Sciweavers

1024 search results - page 49 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 10 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
IPSN
2003
Springer
15 years 3 months ago
Hypothesis Testing over Factorizations for Data Association
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
15 years 3 months ago
High-speed VLSI architecture for parallel Reed-Solomon decoder
—This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber op...
Hanho Lee
BTW
2007
Springer
236views Database» more  BTW 2007»
15 years 1 months ago
A Classification of Schema Mappings and Analysis of Mapping Tools
: Schema mapping techniques for data exchange have become popular and useful tools both in research and industry. A schema mapping relates a source schema with a target schema via ...
Frank Legler, Felix Naumann
AUTONOMICS
2008
ACM
14 years 11 months ago
QoS-aware ant routing with colored pheromones in wireless mesh networks
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
Martina Umlauft, Wilfried Elmenreich