Sciweavers

4315 search results - page 239 / 863
» Sorting in linear time
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Aligning traces for performance evaluation
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
IWCMC
2006
ACM
14 years 3 months ago
SCAR: context-aware adaptive routing in delay tolerant mobile sensor networks
Sensor devices are being embedded in all sorts of items including vehicles, furniture but also animal and human bodies through health monitors and tagging techniques. The collecti...
Cecilia Mascolo, Mirco Musolesi
SPIRE
2005
Springer
14 years 3 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
14 years 1 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...
CN
2007
90views more  CN 2007»
13 years 9 months ago
SweetBait: Zero-hour worm detection and containment using low- and high-interaction honeypots
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...
Georgios Portokalidis, Herbert Bos