Sciweavers

66 search results - page 12 / 14
» ais 2011
Sort
View
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
12 years 6 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor
ATAL
2011
Springer
12 years 6 months ago
Online mechanism design for electric vehicle charging
Plug-in hybrid electric vehicles are expected to place a considerable strain on local electricity distribution networks, requiring charging to be coordinated in order to accommoda...
Enrico H. Gerding, Valentin Robu, Sebastian Stein,...
SPEECH
2011
13 years 1 months ago
Intelligibility predictors and neural representation of speech
Intelligibility predictors tell us a great deal about human speech perception, in particular which acoustic factors strongly effect human behavior, and which do not. A particular...
Bryce E. Lobdell, Jont B. Allen, Mark Hasegawa-Joh...
ATAL
2011
Springer
12 years 6 months ago
Quality guarantees for region optimal DCOP algorithms
k- and t-optimality algorithms [9, 6] provide solutions to DCOPs that are optimal in regions characterized by its size and distance respectively. Moreover, they provide quality gu...
Meritxell Vinyals, Eric Shieh, Jesús Cerqui...
DAM
2011
13 years 1 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire