Sciweavers

2969 search results - page 410 / 594
» A space efficient algorithm for group structure computation
Sort
View
JACM
2000
131views more  JACM 2000»
15 years 6 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
179
Voted
MCS
2005
Springer
15 years 11 months ago
Cluster-Based Cumulative Ensembles
Abstract. In this paper, we propose a cluster-based cumulative representation for cluster ensembles. Cluster labels are mapped to incrementally accumulated clusters, and a matching...
Hanan Ayad, Mohamed S. Kamel
ECCV
2008
Springer
16 years 8 months ago
Multi-stage Contour Based Detection of Deformable Objects
We present an efficient multi stage approach to detection of deformable objects in real, cluttered images given a single or few hand drawn examples as models. The method handles de...
Saiprasad Ravishankar, Arpit Jain, Anurag Mittal
TOG
2002
212views more  TOG 2002»
15 years 5 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...
308
Voted
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 7 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas