2957 search results - page 435 / 592 » The Complexity of Polynomial-Time Approximation |
ICTAI
1997
IEEE
14 years 1 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
ICCV
1995
IEEE
14 years 1 months ago
1995
IEEE
A new information-theoretic approach is presented for finding the pose of an object in an image. The technique does not require information about the surface properties of the ob...
APCCAS
2006
IEEE
14 years 6 days ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
NIPS
2007
13 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
SEBD
2007
13 years 11 months ago
2007
In the last few years, we have been witnessing an evergrowing need for continuous observation and monitoring applications. This need is driven by recent technological advances that...