1996 search results - page 126 / 400 » Financial Theory 2 |
132
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
125
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
139
click to vote
IM
2007
15 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
145
click to vote
JNCA
2007
15 years 4 months ago
2007
Cooperation and autonomy are two antagonistic core variables of agent-based systems, and a key challenge in designing such systems is to balance these variables appropriately. Thi...
139
click to vote
DM
1998
15 years 4 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...