750 search results - page 99 / 150 » Reconstruction for Models on Random Graphs |
ICCSA
2010
Springer
15 years 1 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
ACTAC
2007
14 years 12 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
106
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...