Sciweavers

495 search results - page 77 / 99
» Data exchange: computing cores in polynomial time
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ISPASS
2010
IEEE
13 years 6 months ago
Weak execution ordering - exploiting iterative methods on many-core GPUs
Abstract--On NVIDIA's many-core GPUs, there is no synchronization function among parallel thread blocks. When finegranularity of data communication and synchronization is requ...
Jianmin Chen, Zhuo Huang, Feiqi Su, Jih-Kwon Peir,...
RECOMB
2006
Springer
14 years 9 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 3 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
ICSOC
2007
Springer
14 years 3 months ago
Execution Optimization for Composite Services Through Multiple Engines
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
Wubin Li, Zhuofeng Zhao, Jun Fang, Kun Chen