Sciweavers

29386 search results - page 5568 / 5878
» On modeling of self-organizing systems
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SIGMOD
2006
ACM
145views Database» more  SIGMOD 2006»
16 years 7 months ago
Automatic client-server partitioning of data-driven web applications
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
Nicholas Gerner, Fan Yang 0002, Alan J. Demers, Jo...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
16 years 7 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
ICFP
2005
ACM
16 years 6 months ago
Continuations from generalized stack inspection
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
« Prev « First page 5568 / 5878 Last » Next »