Sciweavers

1484 search results - page 273 / 297
» Ants meeting algorithms
Sort
View
TIT
2008
110views more  TIT 2008»
13 years 10 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
JFP
2000
163views more  JFP 2000»
13 years 9 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 9 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
TON
2010
197views more  TON 2010»
13 years 8 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
IMC
2010
ACM
13 years 8 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang