Sciweavers

1433 search results - page 134 / 287
» On Covering Problems of Rado
Sort
View
CJ
2008
97views more  CJ 2008»
15 years 6 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
DISOPT
2006
155views more  DISOPT 2006»
15 years 6 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
CVPR
2008
IEEE
16 years 8 months ago
IM2GPS: estimating geographic information from a single image
Estimating geographic information from an image is an excellent, difficult high-level computer vision problem whose time has come. The emergence of vast amounts of geographically-...
James Hays, Alexei A. Efros
VLDB
2001
ACM
107views Database» more  VLDB 2001»
16 years 6 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
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...