Sciweavers

2107 search results - page 104 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
AUTOMATICA
2007
116views more  AUTOMATICA 2007»
15 years 3 months ago
Periodic input estimation for linear periodic systems: Automotive engine applications
In this paper, we consider periodic linear systems driven by T0-periodic signals that we desire to reconstruct. The systems under consideration are of the form ˙x =A(t)x +A0(t)w(...
Jonathan Chauvin, Gilles Corde, Nicolas Petit, Pie...
131
Voted
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 10 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
COMPGEOM
1992
ACM
15 years 7 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
ICML
2009
IEEE
16 years 4 months ago
Learning dictionaries of stable autoregressive models for audio scene analysis
In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We fo...
Youngmin Cho, Lawrence K. Saul
108
Voted
SIGCOMM
2009
ACM
15 years 10 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...