Sciweavers

523 search results - page 6 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 5 days ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
TOC
2008
94views more  TOC 2008»
13 years 8 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
CHI
2008
ACM
14 years 9 months ago
Rapid image analysis using neural signals
The problem of extracting information from large collections of imagery is a challenge with few good solutions. Computers typically cannot interpret imagery as effectively as huma...
Santosh Mathan, Deniz Erdogmus, Yonghong Huang, Mi...
ICCAD
2000
IEEE
153views Hardware» more  ICCAD 2000»
14 years 4 days ago
Slope Propagation in Static Timing Analysis
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
David Blaauw, Vladimir Zolotov, Savithri Sundaresw...