Sciweavers

1573 search results - page 249 / 315
» A Data Structure for Sponsored Search
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 1 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
NAR
1998
122views more  NAR 1998»
14 years 11 months ago
The PIR-International Protein Sequence Database
The Protein Information Resource (PIR; http://wwwnbrf.georgetown.edu/pir/ ) supports research on molecular evolution, functional genomics, and computational biology by maintaining...
Winona C. Barker, John S. Garavelli, Daniel H. Haf...
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
15 years 12 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
AAAI
1990
15 years 1 months ago
Constructor: A System for the Induction of Probabilistic Models
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
Robert M. Fung, Stuart L. Crawford
JODL
2000
123views more  JODL 2000»
14 years 11 months ago
On Z39.50 wrapping and description logics
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
Yannis Velegrakis, Vassilis Christophides, Panos C...