4114 search results - page 428 / 823 » Efficient Algorithms for the 2-Center Problems |
141
click to vote
ASPDAC
2004
ACM
16 years 8 days ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
199
click to vote
CONSTRAINTS
2002
15 years 6 months ago
2002
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
190
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...
159
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gaine...
157
click to vote
IVS
2002
15 years 6 months ago
2002
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...