Sciweavers

2889 search results - page 245 / 578
» Querying Structured Hyperdocuments
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 6 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
VLDB
2004
ACM
137views Database» more  VLDB 2004»
15 years 12 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
SIGIR
1996
ACM
15 years 10 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
BMCBI
2007
142views more  BMCBI 2007»
15 years 6 months ago
Predicting and improving the protein sequence alignment quality by support vector regression
Background: For successful protein structure prediction by comparative modeling, in addition to identifying a good template protein with known structure, obtaining an accurate seq...
Minho Lee, Chan-seok Jeong, Dongsup Kim