395 search results - page 24 / 79 » Polynomial Approximations for Model Checking |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
MSS
1999
IEEE
15 years 2 months ago
1999
IEEE
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...