4843 search results - page 727 / 969 » The Shortcut Problem - Complexity and Approximation |
159
Voted
SDM
2009
SIAM
16 years 29 days ago
2009
SIAM
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
123
Voted
ALT
2002
Springer
16 years 21 days ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
125
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
110
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
127
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...