Sciweavers

3136 search results - page 142 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ISMAR
2009
IEEE
16 years 1 months ago
A dataset and evaluation methodology for template-based tracking algorithms
Unlike dense stereo, optical flow or multi-view stereo, templatebased tracking lacks benchmark datasets allowing a fair comparison between state-of-the-art algorithms. Until now,...
Sebastian Lieberknecht, Selim Benhimane, Peter Geo...
ICSEA
2007
IEEE
16 years 20 days ago
A Model for the Effect of Caching on Algorithmic Efficiency in Radix based Sorting
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
Arne Maus, Stein Gjessing
SENSYS
2003
ACM
15 years 11 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
CN
1998
64views more  CN 1998»
15 years 6 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 14 days ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez