Sciweavers

5005 search results - page 430 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
PODC
2005
ACM
16 years 10 days ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
FSTTCS
1995
Springer
15 years 10 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He
TCOM
2010
115views more  TCOM 2010»
15 years 5 months ago
QoS Analysis of a Scheduling Policy for Heterogeneous Users Employing AMC Jointly with ARQ
—This paper analyzes the quality of service (QoS) of scheduling algorithms for heterogeneous users in multiuser (MU) wireless systems that take advantage from a crosslayer design...
Mario Poggioni, Luca Rugini, Paolo Banelli
CIKM
2010
Springer
15 years 4 months ago
Fast dimension reduction for document classification based on imprecise spectrum analysis
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...
Hu Guan, Bin Xiao, Jingyu Zhou, Minyi Guo, Tao Yan...