Sciweavers

1220 search results - page 83 / 244
» Minimal Interval Completions
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
GI
1999
Springer
14 years 1 months ago
Caching in Networks
d Abstract) Friedhelm Meyer auf der Heide   Berthold V¨ocking† Matthias Westermann   We present a general framework for the development of online algorithms for data manageme...
Matthias Westermann
INFOCOM
2011
IEEE
13 years 28 days ago
Resource management for fading wireless channels with energy harvesting nodes
—Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the no...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
CVPR
2010
IEEE
14 years 5 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
INFOCOM
2008
IEEE
14 years 3 months ago
Task Scheduling and Lightpath Establishment in Optical Grids
—Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where computing tasks are executed. For a future WDM ne...
Xin Liu, Wei Wei, Chunming Qiao, Ting Wang, Weishe...