Sciweavers

256 search results - page 20 / 52
» A Unified Approach to Approximating Partial Covering Problem...
Sort
View
VLDB
2001
ACM
107views Database» more  VLDB 2001»
14 years 7 months ago
A survey of approaches to automatic schema matching
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
Erhard Rahm, Philip A. Bernstein
FOCS
2006
IEEE
14 years 1 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 8 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi