685 search results - page 47 / 137 » Succinct Trees in Practice |
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
SEBD
2003
13 years 9 months ago
2003
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
AAAI
2011
12 years 7 months ago
2011
Recognizing possibly thousands of objects is a crucial capability for an autonomous agent to understand and interact with everyday environments. Practical object recognition comes...
BMCBI
2008
13 years 7 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...