Sciweavers

1059 search results - page 84 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
CIKM
2008
Springer
14 years 11 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
CP
2006
Springer
15 years 1 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
MM
2006
ACM
108views Multimedia» more  MM 2006»
15 years 3 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
COLT
2008
Springer
14 years 11 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor
IPSN
2007
Springer
15 years 4 months ago
Object tracking in the presence of occlusions via a camera network
This paper describes a sensor network approach to tracking a single object in the presence of static and moving occluders using a network of cameras. To conserve communication ban...
Ali Ozer Ercan, Abbas El Gamal, Leonidas J. Guibas