Sciweavers

11213 search results - page 273 / 2243
» Low-contention data structures
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello
ICIP
2008
IEEE
16 years 8 months ago
Learning structurally discriminant features in 3D faces
In this paper, we derive a data mining framework to analyze 3D features on human faces. The framework leverages kernel density estimators, genetic algorithm and an information com...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....
DCC
2008
IEEE
16 years 1 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson
IJNVO
2011
47views more  IJNVO 2011»
15 years 1 months ago
Harvesting covert networks: a case study of the iMiner database
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
CACM
1998
110views more  CACM 1998»
15 years 6 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon