339 search results - page 40 / 68 » Is the Euclidean algorithm optimal among its peers |
ICML
2002
IEEE
14 years 9 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
JCST
2008
13 years 8 months ago
2008
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
ICDCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...
TON
2010
13 years 7 months ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
TJS
2002
13 years 8 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...