Sciweavers

6549 search results - page 1061 / 1310
» Parsimonious additive models
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 6 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
MST
2006
100views more  MST 2006»
15 years 6 months ago
On Delivery Times in Packet Networks under Adversarial Traffic
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
Adi Rosén, Michael S. Tsirkin
IANDC
2007
126views more  IANDC 2007»
15 years 6 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
PERCOM
2008
ACM
15 years 6 months ago
Randomized Bit Encoding for Stronger Backward Channel Protection in RFID Systems
In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags. This scheme is used together with the backward channel protec...
Tong-Lee Lim, Tieyan Li, Sze-Ling Yeo
PERVASIVE
2008
Springer
15 years 6 months ago
Context-aware routing in wireless mesh networks
Wireless mesh networks promise to deliver resilient connectivity among network nodes, allowing data to be relayed seamlessly between mobile clients and infrastructure. Routing is ...
Peizhao Hu, Marius Portmann, Ricky Robinson, Jadwi...
« Prev « First page 1061 / 1310 Last » Next »