15485 search results - page 398 / 3097 » Computing Optimal Subsets |
189
click to vote
ICALP
2003
Springer
16 years 4 hour ago
2003
Springer
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
148
click to vote
COLING
2002
15 years 6 months ago
2002
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature ...
193
click to vote
COLING
2002
15 years 6 months ago
2002
We describe a mechanism for the generation of lexical paraphrases of queries posed to an Internet resource. These paraphrases are generated using WordNet and part-of-speech inform...
162
click to vote
DM
2002
15 years 6 months ago
2002
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...
162
Voted
COMBINATORICA
2008
15 years 5 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...