Sciweavers

1675 search results - page 211 / 335
» Implementing Data Cubes Efficiently
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
132
Voted
EWSN
2009
Springer
16 years 4 months ago
Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols
Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In th...
Konrad Iwanicki, Maarten van Steen
111
Voted
DCC
2004
IEEE
16 years 3 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
123
Voted
WETICE
2009
IEEE
15 years 10 months ago
Smart Metering the Clouds
— As cloud computing becomes increasingly pervasive, the data center energy consumption attributable to cloud computing is climbing, despite the clarion call of action to reduce ...
Tarry Singh, Pavan Kuman Vara
IAT
2008
IEEE
15 years 10 months ago
Social and Personal Context Modeling for Contact List Recommendation on Mobile Device
This paper presents a social and personal context modeling method on mobile device. It infers user’s contexts, such as amity with others and emotional state, from uncertain logs...
Jun-Ki Min, Hee-Taek Kim, Sung-Bae Cho