1331 search results - page 223 / 267 » Complexity bounds for zero-test algorithms |
AINA
2008
IEEE
14 years 2 months ago
2008
IEEE
—In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected...
APCSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
SIGGRAPH
2000
ACM
14 years 2 days ago
2000
ACM
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
COCO
1998
Springer
13 years 12 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...