Sciweavers

242 search results - page 46 / 49
» Compact Fundamental Matrix Computation
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 25 days ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 11 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
BMCBI
2007
107views more  BMCBI 2007»
14 years 11 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
119
Voted
TVCG
2008
167views more  TVCG 2008»
14 years 10 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...
CVPR
2003
IEEE
16 years 1 months ago
Learning epipolar geometry from image sequences
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
Yonatan Wexler, Andrew W. Fitzgibbon, Andrew Zisse...