Sciweavers

3136 search results - page 302 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
JCST
2006
65views more  JCST 2006»
15 years 6 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
CVPR
2009
IEEE
2160views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Image Deblurring and Denoising using Color Priors
Image blur and noise are difficult to avoid in many situations and can often ruin a photograph. We present a novel image deconvolution algorithm that deblurs and denoises an ima...
C. Lawrence Zitnick, David J. Kriegman, Neel Joshi...
CVPR
2001
IEEE
16 years 8 months ago
Scene-Consistent Detection of Feature Points in Video Sequences
Detection of feature points in images is an important preprocessing stage for many algorithms in Computer Vision. We address the problem of detection of feature points in video se...
Ariel Tankus, Yehezkel Yeshurun
ECCV
2004
Springer
16 years 8 months ago
Structure and Motion from Images of Smooth Textureless Objects
This paper addresses the problem of estimating the 3D shape of a smooth textureless solid from multiple images acquired under orthographic projection from unknown and unconstrained...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...