Sciweavers

238 search results - page 33 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 1 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
CVPR
2007
IEEE
15 years 11 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
DC
2010
14 years 9 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
COMPSAC
2008
IEEE
15 years 4 months ago
Parallel Table Lookup for Next Generation Internet
The rapid growth of Internet population leads to the shortage of IP addresses. The next generation IP protocol, IPv6, which extends the IP address length from 32 bits to 128 bits,...
Li-Che Hung, Yaw-Chung Chen
VLDB
2005
ACM
206views Database» more  VLDB 2005»
15 years 3 months ago
Native XML Support in DB2 Universal Database
The major relational database systems have been providing XML support for several years, predominantly by mapping XML to existing concepts such as LOBs or (object-)relational tabl...
Matthias Nicola, Bert Van der Linden