Sciweavers

11784 search results - page 650 / 2357
» Interpolation for data structures
Sort
View
COLING
2010
15 years 2 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
ICASSP
2011
IEEE
14 years 11 months ago
Quantization and power allocation in wireless sensor networks with correlated data
Abstract— This work addresses the problem of joint quantization and power allocation in wireless sensor networks where sensors observe a source, quantize their observations and t...
Muhammad Hafeez Chaudhary, Luc Vandendorpe
ICDT
2005
ACM
88views Database» more  ICDT 2005»
16 years 23 days ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
ICML
1997
IEEE
16 years 8 months ago
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
Nir Friedman
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 7 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...