4926 search results - page 570 / 986 » Two Graph Algorithms On an Associative Computing Model |
153
click to vote
ISBI
2009
IEEE
15 years 10 months ago
2009
IEEE
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
139
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
149
click to vote
NETCOOP
2007
Springer
15 years 9 months ago
2007
Springer
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
112
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
146
click to vote
CONSTRAINTS
2006
15 years 3 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...