49 search results - page 5 / 10 » On Perfect Matching Coverings and Even Subgraph Coverings |
AICCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
DEXA
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
SAT
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
WADS
1997
Springer
13 years 11 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...