Sciweavers

9842 search results - page 1813 / 1969
» Problem complexity
Sort
View
144
Voted
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 3 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
130
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 3 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CIKM
2011
Springer
14 years 22 days ago
Tractable XML data exchange via relations
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
Rada Chirkova, Leonid Libkin, Juan L. Reutter
IACR
2011
111views more  IACR 2011»
14 years 12 days ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ICC
2011
IEEE
201views Communications» more  ICC 2011»
14 years 11 days ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
« Prev « First page 1813 / 1969 Last » Next »