20 search results - page 4 / 4 » Worst case complexity of direct search under convexity |
FORTE
2000
13 years 6 months ago
2000
The adventof multipoint(multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we prese...
PAMI
2002
13 years 4 months ago
2002
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
ECUMN
2007
Springer
13 years 11 months ago
2007
Springer
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
IEEEPACT
1997
IEEE
13 years 9 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
CBMS
2007
IEEE
13 years 11 months ago
2007
IEEE
The abundance of complex media-rich information in state-of-the-art bio-medical sciences underlines the importance of paradigms for organizing, searching, browsing, and assimilati...