Sciweavers

2485 search results - page 89 / 497
» Time Bounded Frequency Computations
Sort
View
COLT
2006
Springer
15 years 8 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
147
Voted
ISORC
2008
IEEE
15 years 11 months ago
Toward Libraries for Real-Time Java
Reusable libraries are problematic for real-time software in Java. Using Java’s standard class library, for example, demands meticulous coding and testing to avoid response time...
Trevor Harmon, Martin Schoeberl, Raimund Kirner, R...
JOC
2008
86views more  JOC 2008»
15 years 4 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
ICPR
2004
IEEE
16 years 5 months ago
Spectral Sound Gap Filling
We present a new method for automatically filling in gaps of textural sounds. Our approach is to transform the signal to the time-frequency space, fill in the gap, and apply the i...
Alon Fishbach, Iddo Drori, Yehezkel Yeshurun
AINA
2008
IEEE
15 years 6 months ago
An Efficient Tree-Based Tag Identification Protocol for RFID Systems
This paper presents an efficient tree-based query protocol for tag identification in Radio Frequency Identification (RFID) systems. Instead of reducing collisions, our proposed pro...
Kuo-Hui Yeh, N. W. Lo, Enrico Winata