Sciweavers

352 search results - page 5 / 71
» Algorithms to Test Ray-Triangle Intersection. Comparative St...
Sort
View
ECCV
2006
Springer
14 years 8 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
SIGIR
1999
ACM
13 years 11 months ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 8 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
VC
2008
190views more  VC 2008»
13 years 6 months ago
Fast collision detection using the A-buffer
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
Han-Young Jang, JungHyun Han
SIMUTOOLS
2008
13 years 8 months ago
ns-2 vs. OPNET: a comparative study of the IEEE 802.11e technology on MANET environments
In this work we present the results of a comparative study between two well-known network simulators: ns-2 and OPNET Modeler. In particular, we focus on a performance evaluation o...
P. Pablo Garrido, Manuel P. Malumbres, Carlos Migu...