Sciweavers

6274 search results - page 154 / 1255
» From query complexity to computational complexity
Sort
View
VLDB
2001
ACM
113views Database» more  VLDB 2001»
15 years 8 months ago
Querying XML Views of Relational Data
XML has emerged as the standard data exchange format for Internet-based business applications. This has created the need to publish existing business data, stored in relational da...
Jayavel Shanmugasundaram, Jerry Kiernan, Eugene J....
DALT
2009
Springer
15 years 7 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
FSTTCS
2010
Springer
15 years 2 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
ESAW
2009
Springer
15 years 10 months ago
Peer-to-Peer Overlay Network Based on Swarm Intelligence
As the number of information in the Internet constantly increases and the complexity of systems rapidly grows, locating and manipulating complex data has become a difficult task. W...
Vesna Sesum-Cavic, eva Kühn
IPTPS
2005
Springer
15 years 9 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang