Sciweavers

613 search results - page 123 / 123
» Matching Power
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 1 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
SIGMOD
2012
ACM
190views Database» more  SIGMOD 2012»
11 years 7 months ago
Sample-driven schema mapping
End-users increasingly find the need to perform light-weight, customized schema mapping. State-of-the-art tools provide powerful functions to generate schema mappings, but they u...
Li Qian, Michael J. Cafarella, H. V. Jagadish
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 5 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi