Sciweavers

2343 search results - page 267 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ICCV
2009
IEEE
15 years 4 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
181
Voted
CVPR
2006
IEEE
16 years 8 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
STACS
2005
Springer
15 years 12 months ago
Cycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
IPPS
2003
IEEE
15 years 11 months ago
Expresso and Chips: Creating a Next Generation Microarray Experiment Management System
Expresso is an experiment management system that is designed to assist biologists in planning, executing, and interpreting microarray experiments. It serves as a unifying framewor...
Allan A. Sioson, Jonathan I. Watkinson, Cecilia Va...
CONCUR
1993
Springer
15 years 10 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer