Sciweavers

2899 search results - page 535 / 580
» Dynamic Trees in Practice
Sort
View
OOPSLA
2007
Springer
14 years 4 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
ICNP
2006
IEEE
14 years 4 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
P2P
2006
IEEE
121views Communications» more  P2P 2006»
14 years 4 months ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips
VLSID
2006
IEEE
183views VLSI» more  VLSID 2006»
14 years 4 months ago
Design Challenges for High Performance Nano-Technology
This tutorial present the key aspects of design challenges and its solutions that are being experienced in VLSI design in the era of nano technology. The focus will be on design c...
Goutam Debnath, Paul J. Thadikaran
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 3 months ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...