Sciweavers

605 search results - page 102 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
IROS
2006
IEEE
159views Robotics» more  IROS 2006»
15 years 3 months ago
Multi-Level Surface Maps for Outdoor Terrain Mapping and Loop Closing
— To operate outdoors or on non-flat surfaces, mobile robots need appropriate data structures that provide a compact representation of the environment and at the same time suppo...
Rudolph Triebel, Patrick Pfaff, Wolfram Burgard
COMPGEOM
2005
ACM
14 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
BMCBI
2008
133views more  BMCBI 2008»
14 years 9 months ago
ElliPro: a new structure-based tool for the prediction of antibody epitopes
Background: Reliable prediction of antibody, or B-cell, epitopes remains challenging yet highly desirable for the design of vaccines and immunodiagnostics. A correlation between a...
Julia V. Ponomarenko, Huynh-Hoa Bui, Wei Li, Nicho...
ICCV
2011
IEEE
13 years 9 months ago
The Generalized Trace-Norm and its Application to Structure-from-Motion Problems
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
Roland Angst, Christopher Zach, Marc Pollefeys