1973 search results - page 42 / 395 » The Construction of Ludic Space |
IDA
2003
Springer
14 years 1 months ago
2003
Springer
Rule systems have failed to attract much interest in large data analysis problems because they tend to be too simplistic to be useful or consist of too many rules for human interpr...
EDBT
2010
ACM
13 years 11 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
AAAI
2007
13 years 10 months ago
2007
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
TSP
2008
13 years 8 months ago
2008
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
COMBINATORICS
1998
13 years 8 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...