Sciweavers

2520 search results - page 101 / 504
» The complexity of approximating entropy
Sort
View
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
15 years 2 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
15 years 2 months ago
An approximation scheme for energy-efficient scheduling of real-time tasks in heterogeneous multiprocessor systems
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
Chuan-Yue Yang, Jian-Jia Chen, Tei-Wei Kuo, Lothar...
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
14 years 10 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
INFOCOM
2012
IEEE
13 years 24 days ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
VMCAI
2005
Springer
15 years 3 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan