50 search results - page 5 / 10 » Maximum inner-product search using cone trees |
ACL
2004
14 years 11 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
SIGGRAPH
2000
ACM
15 years 1 months ago
2000
ACM
Approximating detailed models with coarse, texture-mapped meshes results in polygonal silhouettes. To eliminate this artifact, we introduce silhouette clipping, a framework for ef...
JACM
2007
14 years 9 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
105
Voted
SPIRE
2004
Springer
15 years 2 months ago
2004
Springer
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...