Sciweavers

4150 search results - page 128 / 830
» A Practical Approach to Model Extension
Sort
View
185
Voted
PAMI
2012
13 years 6 months ago
LDAHash: Improved Matching with Smaller Descriptors
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
Christoph Strecha, Alexander A. Bronstein, Michael...
117
Voted
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 9 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
118
Voted
UAI
2008
15 years 5 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
129
Voted
SPIN
2010
Springer
15 years 2 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
125
Voted
KBSE
2006
IEEE
15 years 9 months ago
Modularity Analysis of Logical Design Models
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
Yuanfang Cai, Kevin J. Sullivan