Sciweavers

4886 search results - page 926 / 978
» Approximate Data Exchange
Sort
View
DEXA
2008
Springer
132views Database» more  DEXA 2008»
13 years 11 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
DICTA
2003
13 years 10 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
IIS
2003
13 years 10 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
VMV
2004
185views Visualization» more  VMV 2004»
13 years 10 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
UAI
2000
13 years 10 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller