Sciweavers

1576 search results - page 105 / 316
» Streaming Algorithms for Independent Sets
Sort
View
IPPS
2009
IEEE
15 years 4 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
COLT
1991
Springer
15 years 1 months ago
Improved Learning of AC0 Functions
Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smit...
JMLR
2010
158views more  JMLR 2010»
14 years 4 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
14 years 9 months ago
javax.XXL: A prototype for a Library of Query processing Algorithms
In this paper we describe XXL (eXtensible and fleXible Library), a toolkit for rapid prototyping query processing algorithms. XXL is a flexible, high-level, platform independent J...
Jochen Van den Bercken, Jens-Peter Dittrich, Bernh...