Sciweavers

1728 search results - page 204 / 346
» The Accelerated Euclidean Algorithm
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
143
Voted
KDD
2008
ACM
244views Data Mining» more  KDD 2008»
16 years 3 months ago
Probabilistic latent semantic visualization: topic model for visualizing documents
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
Tomoharu Iwata, Takeshi Yamada, Naonori Ueda
ICPR
2008
IEEE
15 years 9 months ago
A new multiobjective simulated annealing based clustering technique using stability and symmetry
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...
Sriparna Saha, Sanghamitra Bandyopadhyay
ICNP
2007
IEEE
15 years 9 months ago
Greedy Virtual Coordinates for Geographic Routing
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...
Ben Leong, Barbara Liskov, Robert Morris
106
Voted
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
15 years 9 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das