Sciweavers

14158 search results - page 226 / 2832
» Generalized switch-setting problems
Sort
View
MCSS
2006
Springer
15 years 3 months ago
A lattice approach to analysis and synthesis problems
Within a lattice approach, the purpose of this paper is to give general necessary and sufficient conditions for internal stabilizability and for the existence of (weakly) left-/rig...
Alban Quadrat
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 8 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 9 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 8 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 9 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...