Sciweavers

3415 search results - page 229 / 683
» Lower bounds on kernelization
Sort
View
COMCOM
2007
79views more  COMCOM 2007»
15 years 6 months ago
Performance implications of a bounded receive buffer in concurrent multipath transfer
— We study the performance of Concurrent Multipath Transfer using SCTP multihoming (CMT) in the presence of a bounded receive buffer (rbuf). We demonstrate using simulation that ...
Janardhan R. Iyengar, Paul D. Amer, Randall R. Ste...
TSP
2008
69views more  TSP 2008»
15 years 6 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 6 months ago
New Bounds for Codes Identifying Vertices in Graphs
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
Gérard D. Cohen, Iiro S. Honkala, Antoine L...
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 4 months ago
AVF Stressmark: Towards an Automated Methodology for Bounding the Worst-Case Vulnerability to Soft Errors
Soft error reliability is increasingly becoming a first-order design concern for microprocessors, as a result of higher transistor counts, shrinking device geometries and lowering ...
Arun A. Nair, Lizy Kurian John, Lieven Eeckhout
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud