Sciweavers

339 search results - page 56 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Object Detection Using 2D Spatial Ordering Constraints
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...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
DCOSS
2010
Springer
14 years 9 days ago
ZeroCal: Automatic MAC Protocol Calibration
Sensor network MAC protocols are typically configured for an intended deployment scenario once and for all at compile time. This approach, however, leads to suboptimal performance...
Andreas Meier, Matthias Woehrle, Marco Zimmerling,...
FCT
2001
Springer
13 years 12 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
CCGRID
2009
IEEE
13 years 8 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan