Sciweavers

1717 search results - page 172 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 8 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
ICML
2004
IEEE
16 years 7 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
VLDB
2009
ACM
165views Database» more  VLDB 2009»
16 years 6 months ago
Online pairing of VoIP conversations
This paper answers the following question; given a multiplicity of evolving 1-way conversations, can a machine or an algorithm discern the conversational pairs in an online fashio...
Michail Vlachos, Aris Anagnostopoulos, Olivier Ver...
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
16 years 3 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
16 years 1 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...