Sciweavers

1404 search results - page 216 / 281
» Complexity of admissible rules
Sort
View
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 3 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
KI
2009
Springer
14 years 3 months ago
Robust Processing of Situated Spoken Dialogue
Spoken dialogue is notoriously hard to process with standard language processing technologies. Dialogue systems must indeed meet two major challenges. First, natural spoken dialogu...
Pierre Lison, Geert-Jan M. Kruijff
IPSN
2010
Springer
14 years 3 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
HICSS
2008
IEEE
175views Biometrics» more  HICSS 2008»
14 years 3 months ago
Service-Oriented Resource Management
Service Management controls how business services are developed and delivered to customers. Business services must be flexible negotiable between customer and provider. Temporal a...
Jürgen Dorn, Hannes Werthner
ICPP
2008
IEEE
14 years 3 months ago
Dynamic Meta-Learning for Failure Prediction in Large-Scale Systems: A Case Study
Despite great efforts on the design of ultra-reliable components, the increase of system size and complexity has outpaced the improvement of component reliability. As a result, fa...
Jiexing Gu, Ziming Zheng, Zhiling Lan, John White,...