Sciweavers

644 search results - page 65 / 129
» Decomposition Complexity
Sort
View
99
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
Curve-sensitive cuttings
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
Vladlen Koltun, Micha Sharir
84
Voted
SIAMCOMP
2010
93views more  SIAMCOMP 2010»
14 years 7 months ago
Tightening Nonsimple Paths and Cycles on Surfaces
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
Éric Colin de Verdière, Jeff Erickso...
90
Voted
EDBT
2006
ACM
116views Database» more  EDBT 2006»
16 years 22 days ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
101
Voted
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
14 years 11 months ago
Design of guaranteed safe maneuvers using reachable sets: Autonomous quadrotor aerobatics in theory and practice
— For many applications, the control of a complex nonlinear system can be made easier by modeling the system as a collection of simplified hybrid modes, each representing a part...
Jeremy H. Gillula, Haomiao Huang, Michael P. Vitus...
ICSE
2003
IEEE-ACM
16 years 21 days ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...