4118 search results - page 156 / 824 » Efficient Algorithms for Airline Problem |
169
Voted
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
202
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
In a number of emerging streaming applications, the data values that are produced have an associated time interval for which they are valid. A useful computation over such streami...
114
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
123
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
131
Voted
ACSC
2002
IEEE
15 years 8 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...