Sciweavers

6756 search results - page 1177 / 1352
» The Structure of Visual Spaces
Sort
View
CPAIOR
2006
Springer
15 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 10 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
DAWAK
2006
Springer
15 years 10 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
DIAGRAMS
2006
Springer
15 years 10 months ago
The Mathematics of Boundaries: A Beginning
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
William Bricken
EGICE
2006
15 years 10 months ago
Combining Two Data Mining Methods for System Identification
System identification is an abductive task which is affected by several kinds of modeling assumptions and measurement errors. Therefore, instead of optimizing values of parameters ...
Sandro Saitta, Benny Raphael, Ian F. C. Smith
« Prev « First page 1177 / 1352 Last » Next »