Sciweavers

62 search results - page 7 / 13
» A Self-stabilizing K-Clustering Algorithm Using an Arbitrary...
Sort
View
IPCO
2001
184views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
IWMM
2011
Springer
217views Hardware» more  IWMM 2011»
14 years 16 days ago
On the theory and potential of LRU-MRU collaborative cache management
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can o...
Xiaoming Gu, Chen Ding
SIGMOD
1998
ACM
129views Database» more  SIGMOD 1998»
15 years 1 months ago
Incremental Distance Join Algorithms for Spatial Databases
Two new spatial join operations, distance join and distance semijoin, are introduced where the join output is ordered by the distance betweenthe spatialattribute values ofthe join...
Gísli R. Hjaltason, Hanan Samet
GRAPHICSINTERFACE
2003
14 years 11 months ago
A Stream Algorithm for the Decimation of Massive Meshes
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
Jianhua Wu, Leif Kobbelt
ICIP
2003
IEEE
15 years 11 months ago
Indexing and segmenting colour images using neighbourhood sequences
In this paper we present some methods for indexing and segmenting colour images. The proposed procedures are based on well-known algorithms, but now we use digital distance functi...
András Hajdu, Benedek Nagy, Zoltán Z...