9719 search results - page 370 / 1944 » Answer Set Optimization |
180
Voted
MLDM
2008
Springer
15 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
174
click to vote
CJ
2002
15 years 6 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
176
click to vote
DATAMINE
2000
15 years 6 months ago
2000
The goal of the CONTROL project at Berkeley is to develop systems for interactive analysis of large data sets. We focus on systems that provide users with iteratively refining answ...
192
click to vote
PAAPP
2007
15 years 6 months ago
2007
In this paper, we present a study on video viewing behavior. Based on a well-suited Markovian model, we have developed a clustering algorithm called K-Models and inspired by the K...
225
click to vote
JELIA
2010
Springer
15 years 5 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...