4131 search results - page 327 / 827 » Compactness in Topology and Computation |
171
Voted
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
169
Voted
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
169
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
172
click to vote
CAIP
1999
Springer
1999
Springer
EigenHistograms: Using Low Dimensional Models of Color Distribution for Real Time Object Recognition
15 years 11 months ago
Abstract. Distribution of object colors has been used in computer vision for recognition and indexing. Most of the recent approaches to this problem have been focused on de ning op...
175
click to vote
CPE
1998
Springer
15 years 11 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...