Sciweavers

3096 search results - page 216 / 620
» The Generalized FITC Approximation
Sort
View
MOBIHOC
2002
ACM
16 years 4 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
SPAA
1999
ACM
15 years 9 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
SIAMMA
2011
97views more  SIAMMA 2011»
14 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
SLSFS
2005
Springer
15 years 10 months ago
Auxiliary Variational Information Maximization for Dimensionality Reduction
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
Felix V. Agakov, David Barber
JETAI
2000
121views more  JETAI 2000»
15 years 4 months ago
Contextual reasoning distilled
In this paper we provide a foundation of a theory of contextual reasoning from the perspective of a theory of knowledge representation. Starting from the so-called metaphor of the...
Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini