Sciweavers

35 search results - page 3 / 7
» Cost-driven octree construction schemes: an experimental stu...
Sort
View
TIFS
2008
157views more  TIFS 2008»
13 years 7 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 2 months ago
Multiplicative synopses for relative-error metrics
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...
Panagiotis Karras
IPCCC
2005
IEEE
14 years 1 months ago
Performance comparison of multiplexing techniques for MPEG-4 object-based content
A study of the performance of a number of different multiplexing schemes was conducted in the context of streaming of MPEG-4 object-based content, with particular emphasis on stre...
Seán Murphy, Stefan Goor, Liam Murphy
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 23 days ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
COMCOM
2011
13 years 2 months ago
Palmtree: An IP alias resolution algorithm with linear probing complexity
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
M. Engin Tozal, Kamil Saraç