3690 search results - page 221 / 738 » Computation with classical sequents |
126
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
111
click to vote
IWINAC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper we explore the use of the Voxel-based Morphometry (VBM) detection clusters to guide the feature extraction processes for the detection of Alzheimer's d...
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
125
click to vote
RANDOM
1998
Springer
15 years 5 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
94
Voted
VISUALIZATION
1996
IEEE
15 years 4 months ago
1996
IEEE
In the last ve years, there has been numerous applications of wavelets and multiresolution analysis in many elds of computer graphics as di erent as geometric modelling, volume vi...