Sciweavers

54 search results - page 4 / 11
» To Beat or Not to Beat: Beat Gestures in Direction Giving
Sort
View
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
13 years 11 months ago
On the Error Parameter of Dispersers
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon ...
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 5 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri
ECCC
2010
143views more  ECCC 2010»
13 years 2 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
DCOSS
2006
Springer
13 years 9 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
ESANN
2004
13 years 6 months ago
Speaker verification by means of ANNs
In text-dependent speaker verification the speech signals have to be time-aligned. For that purpose dynamic time warping (DTW) can be used which performs the alignment by minimizi...
Urs Niesen, Beat Pfister