Sciweavers

2485 search results - page 96 / 497
» Time Bounded Frequency Computations
Sort
View
EMSOFT
2004
Springer
15 years 10 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
VTC
2007
IEEE
154views Communications» more  VTC 2007»
15 years 11 months ago
An Improved Peak-to-Average Power Ratio Estimation Scheme for OFDM Systems
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...
Chin-Liang Wang, Sheng-Ju Ku, Chun-Ju Yang
CHI
2010
ACM
15 years 2 months ago
The life and times of files and information: a study of desktop provenance
In the field of Human-Computer Interaction, provenance refers to the history and genealogy of a document or file. Provenance helps us to understand the evolution and relationships...
Carlos Jensen, Heather Lonsdale, Eleanor Wynn, Jil...
146
Voted
IPL
2002
118views more  IPL 2002»
15 years 4 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi