Sciweavers

2488 search results - page 466 / 498
» Distributed Non-binary Constraints
Sort
View
123
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 2 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 2 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 2 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
ICSE
2008
IEEE-ACM
16 years 2 months ago
The international workshop on software architectures and mobility (SAM 2008)
E-businesses are increasingly facing the need of porting the provision of their e-services to mobile customers. Evolving requirements, such as reliability, security, scalability, ...
Licia Capra, Rami Bahsoon, Wolfgang Emmerich, Moha...