Sciweavers

320 search results - page 24 / 64
» Overlapping cluster planarity
Sort
View
VLDB
1998
ACM
173views Database» more  VLDB 1998»
13 years 9 months ago
Fast Image Retrieval Using Color-Spatial Information
Abstract. In this paper, we present an image retrieval system that employs both the color and spatial information of images to facilitate the retrieval process. The basic unit used...
Beng Chin Ooi, Kian-Lee Tan, Tat-Seng Chua, Wynne ...
CIKM
2008
Springer
13 years 11 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
WWW
2010
ACM
14 years 1 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 9 months ago
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
IPPS
2008
IEEE
14 years 4 months ago
Introducing gravel: An MPI companion library
A non-trivial challenge in high performance, cluster computing is the communication overhead introduced by the cluster interconnect. A common strategy for addressing this challeng...
Anthony Danalis, Aaron Brown, Lori L. Pollock, D. ...