Sciweavers

2376 search results - page 112 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
TPDS
2008
126views more  TPDS 2008»
13 years 7 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
CVPR
2009
IEEE
15 years 2 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
PADL
2009
Springer
14 years 8 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
DATE
2009
IEEE
132views Hardware» more  DATE 2009»
14 years 2 months ago
An efficent dynamic multicast routing protocol for distributing traffic in NOCs
Nowadays, in MPSoCs and NoCs, multicast protocol is significantly used for many parallel applications such as cache coherency in distributed shared-memory architectures, clock sync...
Masoumeh Ebrahimi, Masoud Daneshtalab, Mohammad Ho...