Sciweavers

1299 search results - page 186 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
On Constant Focal Length Self-Calibration From Multiple Views
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...
Adrien Bartoli, Alain Crouzil, Benoît Bocqui...
136
Voted
RECOMB
1997
Springer
15 years 8 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
121
Voted
DLT
2006
15 years 5 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
SAC
2003
ACM
15 years 9 months ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
CGA
2005
15 years 3 months ago
Designing a Visualization Framework for Multidimensional Data
visualization to abstract data sets like network intrusion detection, recommender systems, and database query results. Although display algorithms are a critical component in the v...
Brent M. Dennis, Sarat Kocherlakota, Amit P. Sawan...