Sciweavers

1208 search results - page 99 / 242
» Uniform eventown problems
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
Rehashing for Bayesian Geometric Hashing
Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. In the last decade a number o...
Ehud Rivlin, Ilya Blayvas, Michael Lifshits, Micha...
ICIP
2009
IEEE
15 years 11 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
ICLP
2009
Springer
15 years 10 months ago
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
Tran Cao Son, Enrico Pontelli, Chiaki Sakama
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
15 years 10 months ago
Maximally informative k-itemsets and their efficient discovery
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 ...
Arno J. Knobbe, Eric K. Y. Ho
CADE
2007
Springer
15 years 10 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim