Sciweavers

95 search results - page 19 / 19
» Lines, Trees, and Branch Spaces
Sort
View
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 4 days ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
MEMBRANE
2009
Springer
13 years 12 months ago
A Look Back at Some Early Results in Membrane Computing
em is a computing model, which abstracts from the way the living cells process chemical compounds in their compartmental structure. The regions defined by a membrane structure con...
Oscar H. Ibarra
STACS
1999
Springer
13 years 9 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
VLDB
1995
ACM
121views Database» more  VLDB 1995»
13 years 8 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
AI
2002
Springer
13 years 5 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro