Sciweavers

4114 search results - page 244 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 8 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
CVPR
2007
IEEE
16 years 8 months ago
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
Hao Wu, Aswin C. Sankaranarayanan, Rama Chellappa
ICPR
2000
IEEE
16 years 7 months ago
Automatic Training of Page Segmentation Algorithms: An Optimization Approach
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
Song Mao, Tapas Kanungo
IJCAI
2003
15 years 8 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
ITIIS
2008
135views more  ITIIS 2008»
15 years 6 months ago
Enhanced Pulse Protocol RFID Reader Anti-collision Algorithm using Slot Occupied Probability in Dense Reader Environment
The Radio Frequency IDentification (RFID) system is a contactless automatic identification system, which comprises readers and tags. In RFID systems, a reader collision occurs whe...
InChan Song, Xiao Fan, KyungHi Chang