1510 search results - page 205 / 302 » Upper Probabilities and Additivity |
141
click to vote
ISTCS
1997
Springer
15 years 8 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
140
click to vote
RECOMB
1997
Springer
15 years 8 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
132
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
152
click to vote
FPGA
2006
ACM
15 years 8 months ago
2006
ACM
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
131
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...