Sciweavers

886 search results - page 170 / 178
» On the Autoreducibility of Random Sequences
Sort
View
ECML
2004
Springer
13 years 11 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
ACL
2006
13 years 9 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning
CIC
2006
121views Communications» more  CIC 2006»
13 years 9 months ago
Performance Studies of a Coding Scheme for a Slepian-Wolf Source Network
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
Azizuddin Abdul Aziz, John C. Kieffer
FAST
2004
13 years 9 months ago
Circus: Opportunistic Block Reordering for Scalable Content Servers
Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement given the rapid growth in disk density, ...
Stergios V. Anastasiadis, Rajiv Wickremesinghe, Je...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...