Sciweavers

2520 search results - page 229 / 504
» The complexity of approximating entropy
Sort
View
RSFDGRC
2005
Springer
127views Data Mining» more  RSFDGRC 2005»
16 years 1 days ago
Hierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
Andrzej Skowron, Piotr Synak
AMEC
2004
Springer
15 years 12 months ago
An Evolutionary Game-Theoretic Comparison of Two Double-Auction Market Designs
In this paper we describe an analysis of two double auction markets— the clearing house auction and the continuous double auction. The complexity of these institutions is such th...
Steve Phelps, Simon Parsons, Peter McBurney
DIS
2004
Springer
15 years 12 months ago
Tiling Databases
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
LICS
2003
IEEE
15 years 12 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
GBRPR
2009
Springer
15 years 11 months ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...