Sciweavers

1248 search results - page 190 / 250
» On the Number of Birch Partitions
Sort
View
96
Voted
COMPGEOM
2009
ACM
15 years 5 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
130
Voted
MASA
2001
Springer
15 years 5 months ago
Intelligent Agents: The Key Concepts
This chapter aims to introduce the reader to the basic issues surrounding the design and implementation of intelligent agents. It begins by motivating the idea of an agent, present...
Michael Wooldridge
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
15 years 5 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
82
Voted
DCC
2000
IEEE
15 years 5 months ago
Trees, Windows, and Tiles for Wavelet Image Compression
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...
Wee Sun Lee
ICCAD
1999
IEEE
89views Hardware» more  ICCAD 1999»
15 years 5 months ago
A bipartition-codec architecture to reduce power in pipelined circuits
This paper proposes a new bipatition-codec architecture that may reduce power consumption of pipelined circuits. We treat each output value of a pipelined circuit as one state of ...
Shanq-Jang Ruan, Rung-Ji Shang, Feipei Lai, Shyh-J...