9176 search results - page 1509 / 1836 » algorithms 2010 |
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
122
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
163
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Ontologies such as taxonomies, product catalogs or web directories are heavily used and hence evolve frequently to meet new requirements or to better reflect the current instance d...