Sciweavers

495 search results - page 43 / 99
» Data exchange: computing cores in polynomial time
Sort
View
EWSN
2010
Springer
14 years 6 months ago
Phoenix: An Epidemic Approach to Time Reconstruction
Abstract. Harsh deployment environments and uncertain run-time conditions create numerous challenges for postmortem time reconstruction methods. For example, motes often reboot and...
Jayant Gupchup, Douglas Carlson, Razvan Musaloiu-E...
PPOPP
2009
ACM
14 years 9 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ISCA
2010
IEEE
405views Hardware» more  ISCA 2010»
14 years 2 months ago
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Recent advances in computing have led to an explosion in the amount of data being generated. Processing the ever-growing data in a timely manner has made throughput computing an i...
Victor W. Lee, Changkyu Kim, Jatin Chhugani, Micha...
DSRT
2005
IEEE
14 years 2 months ago
Modeling Real-Time Distributed Simulation Message Flow in an Open Network
Understanding the characteristics of information flow in large scale real-time distributed virtual simulations (RT-DVS) is important for the development of network services that a...
Dennis M. Moen, J. Mark Pullen
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 2 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler