Sciweavers

4302 search results - page 262 / 861
» Index Pairs Algorithms
Sort
View
CIKM
2005
Springer
15 years 6 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
107
Voted
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 2 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
100
Voted
ICPR
2006
IEEE
16 years 2 months ago
Bijective Image Registration using Thin-Plate Splines
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...
DATE
2002
IEEE
91views Hardware» more  DATE 2002»
15 years 6 months ago
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packin...
Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, ...
APPINF
2003
15 years 2 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar