Sciweavers

3937 search results - page 631 / 788
» Questioning Ubiquitous Computing
Sort
View
EWSN
2009
Springer
14 years 10 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 10 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 10 months ago
Stochastic processes and temporal data mining
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
Paul Cotofrei, Kilian Stoffel
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
14 years 10 months ago
Prioritized Prime Implicant Patterns Puzzle for Novel Logic Synthesis and Optimization
Compare CMOS Logic with Pass-Transistor Logic, a question was raised in our mind: "Does any rule exist that contains all good?" This paper reveals novel logic synthesis ...
Kuo-Hsing Cheng, Shun-Wen Cheng