Sciweavers

4124 search results - page 283 / 825
» Improved Algorithms for Data Migration
Sort
View
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 10 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
ICAC
2008
IEEE
15 years 11 months ago
Guided Problem Diagnosis through Active Learning
There is widespread interest today in developing tools that can diagnose the cause of a system failure accurately and efficiently based on monitoring data collected from the syst...
Songyun Duan, Shivnath Babu
ECML
2004
Springer
15 years 10 months ago
A Boosting Approach to Multiple Instance Learning
In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags...
Peter Auer, Ronald Ortner
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 5 months ago
Particle swarm clustering ensemble
Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recent...
Abbas Ahmadi, Fakhri Karray, Mohamed Kamel
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...