Sciweavers

1240 search results - page 204 / 248
» Computational Structure of coordinate transformations: A gen...
Sort
View
IPCO
1992
112views Optimization» more  IPCO 1992»
14 years 11 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
BIB
2006
141views more  BIB 2006»
14 years 9 months ago
Statistical significance in biological sequence analysis
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
Alexander Yu. Mitrophanov, Mark Borodovsky
ENTCS
2007
103views more  ENTCS 2007»
14 years 9 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
GD
2009
Springer
14 years 7 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
ICCV
2009
IEEE
14 years 7 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong