Sciweavers

1396 search results - page 192 / 280
» Succinct Dynamic Data Structures
Sort
View
IPPS
2006
IEEE
15 years 7 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
WEBDB
1998
Springer
106views Database» more  WEBDB 1998»
15 years 5 months ago
Interactive Query and Search in Semistructured Databases
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
Roy Goldman, Jennifer Widom
FPCA
1995
15 years 5 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
USENIX
1994
15 years 2 months ago
Concert/C: A Language for Distributed Programming
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
Joshua S. Auerbach, Arthur P. Goldberg, Germ&aacut...
TCOM
2008
110views more  TCOM 2008»
15 years 1 months ago
Cross-layer Adaptive Transmission: Optimal Strategies in Fading Channels
We consider cross-layer adaptive transmission for a single-user system with stochastic data traffic and a timevarying wireless channel. The objective is to vary the transmit power ...
Anh Tuan Hoang, Mehul Motani