Sciweavers

139 search results - page 19 / 28
» Fast perfect sampling from linear extensions
Sort
View
BMVC
2010
13 years 6 months ago
Evaluation of dimensionality reduction methods for image auto-annotation
Image auto-annotation is a challenging task in computer vision. The goal of this task is to predict multiple words for generic images automatically. Recent state-of-theart methods...
Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi
ICCV
1999
IEEE
14 years 9 months ago
Calibration of Hand-Held Camera Sequences for Plenoptic Modeling
In this contribution we focus on the calibration of very long image sequences from a hand-held camera that samples the viewing sphere of a scene. View sphere sampling is important...
Reinhard Koch, Marc Pollefeys, Benno Heigl, Luc J....
COMPGEOM
2006
ACM
14 years 1 months ago
Medial axis approximation and unstable flow complex
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
Joachim Giesen, Edgar A. Ramos, Bardia Sadri
IPPS
2009
IEEE
14 years 2 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...