Sciweavers

603 search results - page 114 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
ECCC
2010
124views more  ECCC 2010»
14 years 9 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
66
Voted
AUIC
2005
IEEE
15 years 3 months ago
Aiding Text Entry of Foreign Alphabets with Visual Keyboard Plus
Computer keyboards are used to input hundreds of different languages using many different alphabets. Despite this diversity, the physical layout of keyboards is fairly uniform, ...
L. Rennie, Andy Cockburn
MM
2004
ACM
112views Multimedia» more  MM 2004»
15 years 2 months ago
LyricAlly: automatic synchronization of acoustic musical signals and textual lyrics
We present a prototype that automatically aligns acoustic musical signals with their corresponding textual lyrics, in a manner similar to manually-aligned karaoke. We tackle this ...
Ye Wang, Min-Yen Kan, Tin Lay Nwe, Arun Shenoy, Ju...
84
Voted
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
14 years 7 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...