175 search results - page 29 / 35 » max-cut and Containment Relations in Graphs |
FOCS
1998
IEEE
14 years 25 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
PVLDB
2010
13 years 3 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
ICNC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, after a new DNA-based semantic model is theoretically proposed, the preliminary experiment on construction of the small test model is successfully done. This model, ...