Sciweavers

3575 search results - page 235 / 715
» Presentations of computably enumerable reals
Sort
View
COMPGEOM
2004
ACM
16 years 8 hour ago
An energy-driven approach to linkage unfolding
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
Jason H. Cantarella, Erik D. Demaine, Hayley N. Ib...
KES
2004
Springer
15 years 12 months ago
Chance Discovery with Emergence of Future Scenarios
A "chance" is an event or a situation significant for making a decision in a complex environment. Since we organized a session of Chance Discovery in KES 2000, the basic...
Yukio Ohsawa
INFOVIS
2003
IEEE
15 years 12 months ago
FundExplorer: Supporting the Diversification of Mutual Fund Portfolios Using Context Treemaps
An equity mutual fund is a financial instrument that invests in a set of stocks. Any two different funds may partially invest in some of the same stocks, thus overlap is common. P...
Christoph Csallner, Marcus Handte, Othmar Lehmann,...
AUSAI
2003
Springer
15 years 11 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
INAP
2001
Springer
15 years 11 months ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson