Sciweavers

1439 search results - page 34 / 288
» Fast approximation of centrality
Sort
View
122
Voted
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 9 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
122
Voted
ESWS
2005
Springer
15 years 9 months ago
Extending HCONE-Merge by Approximating the Intended Meaning of Ontology Concepts Iteratively
A central aspect of HCONE-merge is the mapping of ontology concepts to a hidden intermediate ontology by uncovering the intended meaning of concepts. Such a mapping is realized by ...
George A. Vouros, Konstantinos Kotis
145
Voted
CASES
2010
ACM
15 years 13 days ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
FAST
2007
15 years 5 months ago
//TRACE: Parallel Trace Replay with Approximate Causal Events
//TRACE1 is a new approach for extracting and replaying traces of parallel applications to recreate their I/O behavior. Its tracing engine automatically discovers inter-node data ...
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasi...
120
Voted
NIPS
2007
15 years 5 months ago
Fast Variational Inference for Large-scale Internet Diagnosis
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
John C. Platt, Emre Kiciman, David A. Maltz