Sciweavers

364 search results - page 11 / 73
» Generalized normal forms and polynomial system solving
Sort
View
MCMASTER
1993
15 years 1 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
14 years 8 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
15 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
ETT
2002
175views Education» more  ETT 2002»
14 years 9 months ago
A multichannel acoustic echo canceler double-talk detector based on a normalized cross-correlation matrix
Multichannel acoustic echo cancellation is basically composed of two parts. One part is a multichannel system identification problem which is nontrivial to solve. The other part, w...
Jacob Benesty, Tomas Gänsler
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking