1871 search results - page 217 / 375 » The Ephemeral Pairing Problem |
168
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
213
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Human identity recognition is an important yet underaddressed
problem. Previous methods were strictly limited
to high quality photographs, where the principal techniques
heavily...
158
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
188
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
173
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...