5100 search results - page 436 / 1020 » The Linear Complexity of a Graph |
234
Voted
ISMAR
2006
IEEE
16 years 1 months ago
2006
IEEE
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
166
click to vote
CSCW
2006
ACM
16 years 1 months ago
2006
ACM
Collaborative object-based graphical editors offer good support for design teams to work concurrently on their design. However, not much research has been done on maintaining cons...
173
click to vote
CPAIOR
2004
Springer
16 years 1 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
183
click to vote
ISSS
1998
IEEE
15 years 12 months ago
1998
IEEE
Complex system specifications are often hierarchically composed of several subsystems. Each subsystem contains one or more processes. In order to provide optimization across diffe...
231
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...