Sciweavers

2767 search results - page 224 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
16 years 2 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...
110
Voted
HYBRID
2010
Springer
15 years 9 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...
123
Voted
DSD
2009
IEEE
111views Hardware» more  DSD 2009»
15 years 9 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&...
126
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 9 months 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
198
Voted
WIA
2009
Springer
15 years 9 months ago
Implementation of State Elimination Using Heuristics
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
Jae-Hee Ahn, Yo-Sub Han