Sciweavers

1449 search results - page 197 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
IEEESCC
2009
IEEE
16 years 28 days ago
JabberWocky: Crowd-Sourcing Metadata for Files
Finding relevant files in a personal file system continues to be a challenge. It is still easier to find stuff on the Web with its exponential growth than in one’s personal ...
Varun Bhagwan, Carlos Maltzahn
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
16 years 6 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
HYBRID
2010
Springer
16 years 1 months ago
Timed automata with observers under energy constraints
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Ni...
DSD
2009
IEEE
111views Hardware» more  DSD 2009»
16 years 1 months ago
Robustness Check for Multiple Faults Using Formal Techniques
Feature sizes in VLSI circuits are steadily shrinking. This results in increasing susceptibility to soft errors, e.g. due to environmental radiation. Precautions against soft error...
Stefan Frehse, Görschwin Fey, André S&...
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 26 days ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku