1376 search results - page 145 / 276 » Searching Trees: An Essay |
164
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
163
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
151
click to vote
BIRD
2007
Springer
16 years 19 days ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
169
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...