Sciweavers

129 search results - page 14 / 26
» Average case analysis of the Boyer-Moore algorithm
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
INFOCOM
2010
IEEE
13 years 5 months ago
On Providing Non-uniform Scheduling Guarantees in a Wireless Network
Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are o...
Vartika Bhandari, Nitin H. Vaidya
TASE
2008
IEEE
13 years 7 months ago
Optimization of Joint Replacement Policies for Multipart Systems by a Rollout Framework
Maintaining an asset with life-limited parts, e.g., a jet engine or an electric generator, may be costly. Certain costs, e.g., setup cost, can be shared if some parts of the asset ...
Tao Sun, Qianchuan Zhao, Peter B. Luh, Robert N. T...
ICCAD
2003
IEEE
205views Hardware» more  ICCAD 2003»
14 years 20 days ago
Statistical Timing Analysis for Intra-Die Process Variations with Spatial Correlations
Process variations have become a critical issue in performance verification of high-performance designs. We present a new, statistical timing analysis method that accounts for int...
Aseem Agarwal, David Blaauw, Vladimir Zolotov
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 26 days ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk