1040 search results - page 149 / 208 » Rounding algorithms for covering problems |
CAV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
114
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
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-...
163
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
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...
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
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...