Sciweavers

807 search results - page 115 / 162
» Competition Adds Complexity
Sort
View
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
14 years 11 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
CLEF
2010
Springer
14 years 11 months ago
A Textual-Based Similarity Approach for Efficient and Scalable External Plagiarism Analysis - Lab Report for PAN at CLEF 2010
In this paper we present an approach to detect external plagiarism based on textual similarity. This is an efficient and precise method that can be applied over large sets of docum...
Daniel Micol, Óscar Ferrández, Ferna...
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 10 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
ICML
2010
IEEE
14 years 10 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
ICASSP
2010
IEEE
14 years 10 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose