Sciweavers

4781 search results - page 774 / 957
» Online algorithms for network design
Sort
View
IWSOC
2005
IEEE
151views Hardware» more  IWSOC 2005»
16 years 14 hour ago
A Low Area and Low Power Programmable Baseband Processor Architecture
A fully programmable radio baseband processor architecture is presented. The architecture is based on a DSP processor core and a number flexible accelerators, connected via a con...
Eric Tell, Anders Nilsson, Dake Liu
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ORL
2010
85views more  ORL 2010»
15 years 4 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
OTM
2010
Springer
15 years 4 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang