Sciweavers

664 search results - page 131 / 133
» Answering order-based queries over XML data
Sort
View
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 8 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
NIPS
2004
13 years 8 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
PVLDB
2010
118views more  PVLDB 2010»
13 years 5 months ago
Global Detection of Complex Copying Relationships Between Sources
Web technologies have enabled data sharing between sources but also simplified copying (and often publishing without proper attribution). The copying relationships can be complex...
Xin Dong, Laure Berti-Equille, Yifan Hu, Divesh Sr...
TKDE
2010
152views more  TKDE 2010»
13 years 5 months ago
Maintaining Recursive Views of Regions and Connectivity in Networks
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 11 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie