Sciweavers

804 search results - page 131 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
ICSE
2009
IEEE-ACM
14 years 2 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
ICA
2007
Springer
14 years 1 months ago
Morphological Diversity and Sparsity in Blind Source Separation
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on mo...
Jérôme Bobin, Yassir Moudden, Jalal F...
SC
2003
ACM
14 years 29 days ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
ECOOP
1998
Springer
13 years 12 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai