3136 search results - page 230 / 628 » Comparison of Clique-Listing Algorithms |
165
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
156
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
194
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
165
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
197
click to vote
IR
2002
15 years 6 months ago
2002
This paper presents the design and evaluation of a text categorization method based on the Hierarchical Mixture of Experts model. This model uses a divide and conquer principle to ...