Sciweavers

5183 search results - page 923 / 1037
» The Complexity of Distributions
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SPAA
2009
ACM
16 years 6 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
PODS
2009
ACM
124views Database» more  PODS 2009»
16 years 6 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
FOCS
2008
IEEE
16 years 25 days ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
BMCBI
2010
90views more  BMCBI 2010»
15 years 6 months ago
PuTmiR: A database for extracting neighboring transcription factors of human microRNAs
Background: Some of the recent investigations in systems biology have revealed the existence of a complex regulatory network between genes, microRNAs (miRNAs) and transcription fa...
Sanghamitra Bandyopadhyay, Malay Bhattacharyya