Sciweavers

315 search results - page 51 / 63
» Cell-probe lower bounds for the partial match problem
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
DCC
2008
IEEE
15 years 9 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
FOCS
2007
IEEE
15 years 4 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
89
Voted
WINE
2007
Springer
120views Economy» more  WINE 2007»
15 years 3 months ago
False-Name-Proof Mechanisms for Hiring a Team
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
Atsushi Iwasaki, David Kempe, Yasumasa Saito, Mahy...
77
Voted
COLT
2005
Springer
15 years 3 months ago
Learning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
Dana Angluin, Jiang Chen