Sciweavers

495 search results - page 7 / 99
» Data exchange: computing cores in polynomial time
Sort
View
PODS
2008
ACM
155views Database» more  PODS 2008»
14 years 6 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...
FCT
2001
Springer
13 years 11 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
SIMPRA
2011
13 years 1 months ago
Virtual segment: Store-carry-forward relay-based support for wide-area non-real-time data exchange
—In the Internet of the future, a flexible, dynamic combination of wireless and wired access networks is expected to be a key driver for enlarging the broadband communication se...
Shinya Yamamura, Akira Nagata, Masato Tsuru, Hitom...
ICPP
1996
IEEE
13 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
ISTCS
1997
Springer
13 years 11 months ago
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
Gilles Brassard, Peter Høyer