Sciweavers

17329 search results - page 49 / 3466
» Improved non-approximability results
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
CHI
2007
ACM
14 years 9 months ago
IGroup: presenting web image search results in semantic clusters
Current web image search engines still rely on user typing textual description: query word(s) for visual targets. As the queries are often short, general or even ambiguous, the im...
Shuo Wang, Feng Jing, Jibo He, Qixing Du, Lei Zhan...
JCDL
2006
ACM
143views Education» more  JCDL 2006»
14 years 2 months ago
Categorizing web search results into meaningful and stable categories using fast-feature techniques
When search results against digital libraries and web resources have limited metadata, augmenting them with meaningful and stable category information can enable better overviews ...
Bill Kules, Jack Kustanowitz, Ben Shneiderman
SIGIR
2010
ACM
13 years 8 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
PAMI
2008
216views more  PAMI 2008»
13 years 8 months ago
Annotating Images by Mining Image Search Results
Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel atte...
Xin-Jing Wang, Lei Zhang 0001, Xirong Li, Wei-Ying...