Sciweavers

664 search results - page 118 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
ALT
2003
Springer
14 years 3 days ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 10 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
INFOCOM
2006
IEEE
14 years 2 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
ISCC
2003
IEEE
14 years 1 months ago
Fair Noiseless Broadcast Source Coding
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...
Serdar Boztas