212 search results - page 36 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
MM
2006
ACM
15 years 5 months ago
2006
ACM
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
PC
2008
14 years 11 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
104
click to vote
ICDE
2009
IEEE
15 years 6 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
182
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
120
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
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...