807 search results - page 95 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
119
Voted
WEBI
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
151
Voted
ICWS
2009
IEEE
15 years 1 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
130
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
170
Voted
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
124
Voted
AAAI
2007
15 years 6 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...