Sciweavers

349 search results - page 57 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
BMCBI
2006
123views more  BMCBI 2006»
13 years 8 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
IVC
2000
179views more  IVC 2000»
13 years 7 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
ECCV
2008
Springer
14 years 9 months ago
Pose Priors for Simultaneously Solving Alignment and Correspondence
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
FOCS
2002
IEEE
14 years 27 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
FOCS
1992
IEEE
14 years 21 hour ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo