Sciweavers

2617 search results - page 120 / 524
» Adaptive local ratio
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
JMLR
2012
13 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
ICASSP
2009
IEEE
16 years 1 months ago
The effectiveness of histogram equalization on environmental model adaptation
In this paper, we introduce a new histogram equalizationbased environmental model adaptation method for robust speech recognition in noise environments. The proposed method adapts...
Youngjoo Suh, Hoirin Kim
AOSE
2005
Springer
16 years 2 days ago
Dealing with Adaptive Multi-agent Organizations in the Gaia Methodology
Changes and adaptations are always necessary after the deployment of a multiagent system (MAS), as well as of any other type of software systems. Some of these changes may be simpl...
Luca Cernuzzi, Franco Zambonelli
IPCCC
2007
IEEE
16 years 25 days ago
Understanding Localized-Scanning Worms
— Localized scanning is a simple technique used by attackers to search for vulnerable hosts. Localized scanning trades off between the local and the global search of vulnerable h...
Zesheng Chen, Chao Chen, Chuanyi Ji