10608 search results - page 254 / 2122 » Complexity of O'Hara's Algorithm |
178
Voted
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
118
click to vote
ICFP
2007
ACM
16 years 14 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
108
click to vote
SDM
2009
SIAM
15 years 9 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...
113
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
109
click to vote
GLOBECOM
2008
IEEE
15 years 7 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...