Search
Now showing items 3611-3620 of 4210
Scalable Information-Sharing Network Management
(2011-06-07)
This thesis analyzes scalable information-sharing network management. It looks into one of the large problems in network management today: finding information across different network domains. Information-sharing network ...
Kernels for Vector-Valued Functions: a Review
(2011-06-30)
Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses ...
A Scalable Information Theoretic Approach to Distributed Robot Coordination
(2011-09-25)
This paper presents a scalable information theoretic approach to infer the state of an environment by distributively controlling robots equipped with sensors. The robots iteratively estimate the environment state using a ...
Source code and data for MWE'2011 papers
(2011-05-09)
Contains the source code and data necessary to run all computations described in the following two papers: Finlayson, Mark A. and Kulkarni, Nidhi (2011) "Detecting Multi-Word Expressions improves Word Sense Disambiguation", ...
Regularization Predicts While Discovering Taxonomy
(2011-06-03)
In this work we discuss a regularization framework to solve multi-category when the classes are described by an underlying class taxonomy. In particular we discuss how to learn the class taxonomy while learning a multi-category ...
A Gaussian Approximation of Feature Space for Fast Image Similarity
(2012-10-01)
We introduce a fast technique for the robust computation of image similarity. It builds on a re-interpretation of the recent exemplar-based SVM approach, where a linear SVM is trained at a query point and distance is ...
The Order Independence of Iterated Dominance in Extensive Games, with Connections to Mechanism Design and Backward Induction
(2012-07-31)
Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. Briefly, this process ...
Multiscale Geometric Methods for Data Sets I: Multiscale SVD, Noise and Curvature
(2012-09-08)
Large data sets are often modeled as being noisy samples from probability distributions in R^D, with D large. It has been noticed that oftentimes the support M of these probability distributions seems to be well-approximated ...
Using Program Synthesis for Social Recommendations
(2012-08-13)
This paper presents a new approach to select events of interest to a user in a social media setting where events are generated by the activities of the user's friends through their mobile devices. We argue that given the ...
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
(2012-08-27)
Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...