427 search results - page 34 / 86 » Computing the Local Consensus of Trees |
154
click to vote
AINA
2007
IEEE
15 years 11 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
135
Voted
CGF
2008
15 years 5 months ago
2008
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
148
click to vote
3DIM
2005
IEEE
15 years 10 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
130
Voted
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
148
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...