Sciweavers

1365 search results - page 185 / 273
» Locality in a web of streams
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
HPCA
2003
IEEE
16 years 6 months ago
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini...
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
MOBISYS
2006
ACM
16 years 6 months ago
CoolSpots: reducing the power consumption of wireless mobile devices with multiple radio interfaces
CoolSpots enable a wireless mobile device to automatically switch between multiple radio interfaces, such as WiFi and Bluetooth, in order to increase battery lifetime. The main co...
Trevor Pering, Yuvraj Agarwal, Rajesh K. Gupta, Ro...
IPPS
2009
IEEE
16 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader