Sciweavers

298 search results - page 11 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
NIPS
2000
14 years 11 months ago
Learning Winner-take-all Competition Between Groups of Neurons in Lateral Inhibitory Networks
It has long been known that lateral inhibition in neural networks can lead to a winner-take-all competition, so that only a single neuron is active at a steady state. Here we show...
Xiaohui Xie, Richard H. R. Hahnloser, H. Sebastian...
FCT
2009
Springer
15 years 4 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
COLING
2010
14 years 4 months ago
EMMA: A novel Evaluation Metric for Morphological Analysis
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
Sebastian Spiegler, Christian Monson
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
14 years 11 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs
CSC
2009
14 years 11 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...