Sciweavers

128 search results - page 15 / 26
» Partitioning a weighted partial order
Sort
View
SDM
2007
SIAM
176views Data Mining» more  SDM 2007»
13 years 8 months ago
Adaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Hichem Frigui, Cheul Hwang
CVPR
2012
IEEE
11 years 9 months ago
SURFing the point clouds: Selective 3D spatial pyramids for category-level object recognition
This paper proposes a novel approach to recognize object categories in point clouds. By quantizing 3D SURF local descriptors, computed on partial 3D shapes extracted from the poin...
Carolina Redondo-Cabrera, Roberto Javier Ló...
SAMOS
2005
Springer
14 years 25 days ago
Automatic FIR Filter Generation for FPGAs
This paper presents a new tool for the automatic generation of highly parallelized Finite Impulse Response (FIR) filters. In this approach we follow our PARO design methodology. P...
Holger Ruckdeschel, Hritam Dutta, Frank Hannig, J&...
BIRTHDAY
2004
Springer
14 years 22 days ago
Duality for Three: Ternary Symmetry in Process Spaces
Ternary algebra has been used for detection of hazards in logic circuits since 1948. Process spaces have been introduced in 1995 act models of concurrent processes. Surprisingly, p...
Janusz A. Brzozowski, Radu Negulescu
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer