Sciweavers

324 search results - page 24 / 65
» Efficient Approximation Algorithms for Floorplan Area Minimi...
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 8 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
IJNM
2008
103views more  IJNM 2008»
13 years 8 months ago
An efficient architecture for Bandwidth Brokers in DiffServ networks
In this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and ...
Christos Bouras, Kostas Stamos
DAC
2009
ACM
14 years 9 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
DATE
2007
IEEE
107views Hardware» more  DATE 2007»
14 years 2 months ago
Routing table minimization for irregular mesh NoCs
The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unreali...
Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam...
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...