9842 search results - page 362 / 1969 » The Complexity of the Matching-Cut Problem |
153
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
151
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
139
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
147
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel hybrid QRD-MCMC MIMO detector that combines the feature of a QRD-M detector and a Markov chain Monte Carlo (MCMC) detector. The QRD-M algorithm i...
142
click to vote
SMA
2005
ACM
15 years 9 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...