Sciweavers

5169 search results - page 132 / 1034
» Locality approximation using time
Sort
View
155
Voted
VLSISP
2010
205views more  VLSISP 2010»
15 years 3 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
STACS
2007
Springer
15 years 11 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
ICC
2007
IEEE
136views Communications» more  ICC 2007»
15 years 11 months ago
Synchronization of Single-Frequency Simulcast Networks Using Network Time Protocol
 Single-frequency simulcast networks use two or more Radio Base Stations (RBS) to transmit simultaneously the same signal on the same radio channel over the service area. To ens...
Stefano Bregni, Luciano Lacavalla, Bruno Propersi,...
183
Voted
AROBOTS
2006
95views more  AROBOTS 2006»
15 years 4 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese
ITC
2003
IEEE
197views Hardware» more  ITC 2003»
15 years 10 months ago
Critical Timing Analysis in Microprocessors Using Near-IR Laser Assisted Device Alteration (LADA)
A scalable laser-based timing analysis technique we call laser assisted device alteration (LADA) is introduced for the rapid isolation and analysis of defect-free performance limi...
Jeremy A. Rowlette, Travis M. Eiles