Sciweavers

613 search results - page 77 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
FC
2009
Springer
118views Cryptology» more  FC 2009»
15 years 4 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...
IPPS
2006
IEEE
15 years 3 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
ESWA
2008
128views more  ESWA 2008»
14 years 9 months ago
Mining the data from a hyperheuristic approach using associative classification
Associative classification is a promising classification approach that utilises association rule mining to construct accurate classification models. In this paper, we investigate ...
Fadi A. Thabtah, Peter I. Cowling
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 1 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière