Sciweavers

493 search results - page 80 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
100
Voted
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 3 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
COOPIS
2003
IEEE
15 years 2 months ago
Static Type-Inference for Trust in Distributed Information Systems
Abstract. Decision-makers in critical fields such as medicine and finance make use of a wide range of information available over the Internet. Mediation, a data integration techn...
Premkumar T. Devanbu, Michael Gertz, Brian Toone
64
Voted
CIKM
2005
Springer
15 years 3 months ago
Interconnection semantics for keyword search in XML
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
15 years 7 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
PODS
2008
ACM
165views Database» more  PODS 2008»
15 years 9 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