Sciweavers

1687 search results - page 54 / 338
» A Functional Link Network With Ordered Basis Functions
Sort
View
COLT
2001
Springer
14 years 1 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
ICC
2007
IEEE
14 years 3 months ago
Network Topology Design to Optimize Link and Switching Costs
—We consider the problem of designing a network which minimizes the total cost of the switching facilities and the fiber links, by choosing the subset of nodes at which to insta...
Benjamin K. Chen, Fouad A. Tobagi
BIOADIT
2006
Springer
14 years 1 months ago
Packet Classification with Evolvable Hardware Hash Functions - An Intrinsic Approach
Bandwidth demands of communication networks are rising permanently. Thus, the requirements to modern routers regarding packet classification are rising accordingly. Conventional al...
Harald Widiger, Ralf Salomon, Dirk Timmermann
INFOCOM
2007
IEEE
14 years 3 months ago
Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links
—Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, suc...
Ying Li, Mung Chiang, A. Robert Calderbank, Suhas ...
GLOBECOM
2008
IEEE
14 years 3 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong