Sciweavers

9871 search results - page 168 / 1975
» On the Structure of Low Sets
Sort
View
SIBGRAPI
2006
IEEE
16 years 14 days ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
CIE
2005
Springer
15 years 12 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
LPNMR
2004
Springer
15 years 11 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
VISUALIZATION
2000
IEEE
15 years 10 months ago
Constructing material interfaces from data sets with volume-fraction information
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann,...
CCIA
2008
Springer
15 years 8 months ago
On the Dimensions of Data Complexity through Synthetic Data Sets
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
Núria Macià, Ester Bernadó-Ma...