4524 search results - page 652 / 905 » The Complexity of Global Constraints |
243
click to vote
WAW
2004
Springer
16 years 22 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
189
click to vote
CIC
2004
15 years 8 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
238
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...
372
click to vote
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...
239
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Latent Variable Models (LVM), like the Shared-GPLVM
and the Spectral Latent Variable Model, help mitigate over-
fitting when learning discriminative methods from small or
modera...