Sciweavers

167 search results - page 4 / 34
» Adaptive Searching in One and Two Dimensions
Sort
View
ICPP
1999
IEEE
15 years 1 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
67
Voted
EDBT
2008
ACM
111views Database» more  EDBT 2008»
15 years 9 months ago
Micro-aggregation-based heuristics for p-sensitive k-anonymity: one step beyond
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
Agusti Solanas, Francesc Sebé, Josep Doming...
COMPGEOM
2010
ACM
15 years 2 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
104
Voted
ICMCS
2006
IEEE
110views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Multimedia indexing and fast retrieval based on a vote system
We present a new system, called Retimm, for searching databases made of documents containing images and text. Images are indexed by colour and texture distributions.. Colour and t...
Sylvie Philipp-Foliguet, Guillaume Logerot, Patric...
CGF
2011
14 years 1 months ago
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Bilkis J. Ferdosi, Jos B. T. M. Roerdink