Sciweavers

492 search results - page 30 / 99
» A Case Study in the use of ROC curves for Algorithm Design
Sort
View
SPAA
2006
ACM
14 years 1 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
SIMULATION
2011
13 years 2 months ago
The Activity-tracking paradigm in discrete-event modeling and simulation: The case of spatially continuous distributed systems
From a modelling and simulation perspective, studying dynamic systems consists of focusing on changes in states. According to the precision of state changes, generic algorithms ca...
Alexandre Muzy, Rajanikanth Jammalamadaka, Bernard...
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CORR
2004
Springer
118views Education» more  CORR 2004»
13 years 7 months ago
Application of the Double Metaphone Algorithm to Amharic Orthography
The Metaphone algorithm applies the phonetic encoding of orthographic sequences to simplify words prior to comparison. While Metaphone has been highly successful for the English l...
Daniel Yacob
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
14 years 28 days ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...