4110 search results - page 516 / 822 » Efficient algorithms for the 2-gathering problem |
308
Voted
POPL
2007
ACM
16 years 7 months ago
2007
ACM
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
208
Voted
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
199
Voted
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
198
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
325
Voted
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
Data mining has been an area of increasing interests during recent years. The association rule discovery problem in particular has been widely studied. However, there are still so...