4860 search results - page 366 / 972 » SNPs Problems, Complexity, and Algorithms |
119
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
115
Voted
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
125
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
145
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Many robot control problems of practical importance, including operational space control, can be reformulated as immediate reward reinforcement learning problems. However, few of ...
205
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...