Sciweavers

17329 search results - page 36 / 3466
» Improved non-approximability results
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Filtering Internet image search results towards keyword based category recognition
In this work we aim to capitalize on the availability of Internet image search engines to automatically create image training sets from user provided queries. This problem is part...
Kamil Wnuk, Stefano Soatto
IDA
2009
Springer
14 years 3 months ago
How to Control Clustering Results? Flexible Clustering Aggregation
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
TAMC
2009
Springer
14 years 3 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
DBISP2P
2005
Springer
183views Database» more  DBISP2P 2005»
14 years 2 months ago
Database Selection and Result Merging in P2P Web Search
Intelligent Web search engines are extremely popular now. Currently, only commercial centralized search engines like Google can process terabytes of Web data. Alternative search en...
Sergey Chernov, Pavel Serdyukov, Matthias Bender, ...
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
14 years 28 days ago
Compiler-Directed Dynamic Computation Reuse: Rationale and Initial Results
Recent studies on value locality reveal that many instructions are frequently executed with a small variety of inputs. This paper proposes an approach that integrates architecture...
Daniel A. Connors, Wen-mei W. Hwu