Sciweavers

759 search results - page 87 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
CGO
2003
IEEE
15 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CVPR
2007
IEEE
15 years 11 months ago
Scene Segmentation and Categorization Using NCuts
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...
Yanjun Zhao, Tao Wang, Peng Wang, Wei Hu, Yangzhou...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
14 years 8 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang