Sciweavers

2610 search results - page 321 / 522
» Computational Probabilistic Non-interference
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
15 years 9 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
123
Voted
MHCI
2005
Springer
15 years 9 months ago
GpsTunes: controlling navigation via audio feedback
We combine the functionality of a mobile Global Positioning System (GPS) with that of an MP3 player, implemented on a PocketPC, to produce a handheld system capable of guiding a u...
Steven Strachan, Parisa Eslambolchilar, Roderick M...
150
Voted
STACS
2005
Springer
15 years 9 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
109
Voted
ICDCS
2003
IEEE
15 years 9 months ago
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
This paper studies the problem of updates in decentralised and self-organising P2P systems in which peers have low online probabilities and only local knowledge. The update strate...
Anwitaman Datta, Manfred Hauswirth, Karl Aberer
IPPS
2003
IEEE
15 years 9 months ago
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...
R. J. Honicky, Ethan L. Miller