Sciweavers

4536 search results - page 776 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 4 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 4 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...
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
14 years 4 months ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...
WECWIS
2006
IEEE
114views ECommerce» more  WECWIS 2006»
14 years 4 months ago
Large-Scale Service Composition in Semantic Service Discovery
Self-Healing and self-optimizing service based applications are important steps towards the self-organizing Service Oriented Architectures (SOA). Self-Organizing SOAs replace serv...
Steffen Bleul, Thomas Weise, Kurt Geihs
SIGIR
2006
ACM
14 years 4 months ago
Near-duplicate detection by instance-level constrained clustering
For the task of near-duplicated document detection, both traditional fingerprinting techniques used in database community and bag-of-word comparison approaches used in information...
Hui Yang, James P. Callan