Sciweavers

9 search results - page 1 / 2
» The Branching Factor of Regular Search Spaces
Sort
View
AAAI
1998
13 years 6 months ago
The Branching Factor of Regular Search Spaces
Manyproblems,such as the sliding-tile puzzles, generate searchtrees wheredifferent nodeshavedifferent numbersof children, in this case dependingon the position of the blank. Wesho...
Stefan Edelkamp, Richard E. Korf
ISCAS
2006
IEEE
116views Hardware» more  ISCAS 2006»
13 years 10 months ago
Wavelet based detection of moving tree branches and leaves in video
—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other h...
B. Ugur Töreyin, A. Enis Çetin
VLDB
1999
ACM
188views Database» more  VLDB 1999»
13 years 9 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
ISCI
2007
141views more  ISCI 2007»
13 years 4 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
PLILP
1993
Springer
13 years 8 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...