Sciweavers

2485 search results - page 376 / 497
» Time Bounded Frequency Computations
Sort
View
MOBIHOC
2012
ACM
11 years 10 months ago
Channel width assignment using relative backlog: extending back-pressure to physical layer
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
Parth H. Pathak, Sankalp Nimbhorkar, Rudra Dutta
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 8 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
14 years 8 days ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
EUROCOLT
1997
Springer
14 years 3 days ago
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
Pascal Koiran, Eduardo D. Sontag
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 8 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...