2745 search results - page 249 / 549 » A fast algorithm for computing large Fibonacci numbers |
165
click to vote
PAMI
2006
15 years 4 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
132
click to vote
RTAS
2010
IEEE
15 years 2 months ago
2010
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
130
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
133
click to vote
EVOW
2007
Springer
15 years 11 months ago
2007
Springer
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
137
click to vote
PAMI
2010
15 years 3 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...