Sciweavers

605 search results - page 78 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
DAM
2000
137views more  DAM 2000»
13 years 9 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
ICRA
2005
IEEE
102views Robotics» more  ICRA 2005»
14 years 3 months ago
SLAM using Incremental Probabilistic PCA and Dimensionality Reduction
— The recent progress in robot mapping (or SLAM) algorithms has focused on estimating either point features (such as landmarks) or grid-based representations. Both of these repre...
Emma Brunskill, Nicholas Roy
SIGGRAPH
2000
ACM
14 years 2 months ago
Surfels: surface elements as rendering primitives
Surface elements (surfels) are a powerful paradigm to efficiently render complex geometric objects at interactive frame rates. Unlike classical surface discretizations, i.e., tri...
Hanspeter Pfister, Matthias Zwicker, Jeroen van Ba...
DCG
2008
118views more  DCG 2008»
13 years 9 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk

Publication
453views
15 years 2 months ago
Analysis and Compensation of Rolling Shutter Effect
Due to the sequential-readout structure of complementary-metal-oxide semiconductor image sensor array, each scanline of the acquired image is exposed at a different time, resulting...
Chia-Kai Liang, Li-Wen Chang, Homer Chen