Sciweavers

5316 search results - page 988 / 1064
» Which Search Problems Are Random
Sort
View
MM
2009
ACM
187views Multimedia» more  MM 2009»
15 years 5 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 5 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
ICPP
1999
IEEE
15 years 5 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
AGENTS
1998
Springer
15 years 5 months ago
A Synergy of Agent Components: Social Comparison for Failure Detection
of other components. This abstract presents an implemented illustration of such explicit component synergy and its usefulness in dynamic multi-agent environments. In such environme...
Gal A. Kaminka, Milind Tambe
CIKM
2008
Springer
15 years 3 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles