3020 search results - page 202 / 604 » Optimal partition trees |
183
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
148
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
155
click to vote
ICCNMC
2005
Springer
16 years 3 days ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
199
click to vote
IFIP12
2008
15 years 8 months ago
2008
Obtaining a bayesian network from data is a learning process that is divided in two steps: structural learning and parametric learning. In this paper, we define an automatic learni...
173
click to vote
ALENEX
2001
15 years 8 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...