Sciweavers

1221 search results - page 168 / 245
» A Comparison of Two Programming Models for Pervasive Computi...
Sort
View
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 8 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
ITNG
2008
IEEE
14 years 3 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
CVPR
2008
IEEE
14 years 2 months ago
General Constraints for Batch Multiple-Target Tracking Applied to Large-Scale Videomicroscopy
While there is a large class of Multiple-Target Tracking (MTT) problems for which batch processing is possible and desirable, batch MTT remains relatively unexplored in comparis...
Kevin Smith, Alan Carleton, Vincent Lepetit
COCOON
2005
Springer
14 years 2 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
PDIS
1994
IEEE
14 years 26 days ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...