Sciweavers

2434 search results - page 299 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 6 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
INFOCOM
2010
IEEE
15 years 2 months ago
Energy-Conserving Scheduling in Multi-hop Wireless Networks with Time-Varying Channels
Abstract— MaxWeight algorithm, a.k.a., back-pressure algorithm, has received much attention as a viable solution for dynamic link scheduling in multi-hop wireless networks. The b...
Yang Song, Chi Zhang, Yuguang Fang, Zhisheng Niu
154
Voted
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
167
Voted
CVPR
2007
IEEE
16 years 5 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
ICML
2005
IEEE
16 years 4 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...