Sciweavers

958 search results - page 90 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
15 years 12 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
14 years 11 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
JMLR
2000
134views more  JMLR 2000»
14 years 10 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan
VLDB
2002
ACM
131views Database» more  VLDB 2002»
14 years 9 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
75
Voted
COLING
2010
14 years 5 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens