Sciweavers

MONET
2002
120views more  MONET 2002»
13 years 11 months ago
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree c...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
MONET
2002
105views more  MONET 2002»
13 years 11 months ago
High Performance Data Broadcasting Systems
Data broadcasting as a means of efficient data dissemination is a key technology facilitating ubiquitous computing. For this reason, broadcast scheduling algorithms have received ...
Peter Triantafillou, R. Harpantidou, Michael Pater...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 11 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
JSS
1998
90views more  JSS 1998»
13 years 11 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 11 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
JSAC
1998
110views more  JSAC 1998»
13 years 11 months ago
Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in ...
Robert J. McEliece, David J. C. MacKay, Jung-Fu Ch...
JPDC
1998
124views more  JPDC 1998»
13 years 11 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
JUCS
2002
179views more  JUCS 2002»
13 years 11 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson
JSC
2002
74views more  JSC 2002»
13 years 11 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
JMLR
2002
106views more  JMLR 2002»
13 years 11 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...