614 search results - page 63 / 123 » Local Computation: Lower and Upper Bounds |
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
71
Voted
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is of...
100
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
SCN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...