644 search results - page 65 / 129 » Decomposition Complexity |
151
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
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...
145
click to vote
SIAMCOMP
2010
15 years 28 days ago
2010
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...
154
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
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 ...
141
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— 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...
139
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
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...