Sciweavers

374 search results - page 39 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
ORL
1998
68views more  ORL 1998»
14 years 9 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
ISCC
2006
IEEE
15 years 3 months ago
An Optimized Peer-to-Peer Overlay Network for Service Discovery
In this paper, we propose DINPeer, an optimized peer-to-peer (P2P) overlay network for service discovery by overcoming limitations in current multicast discovery approaches and P2...
H. Q. Guo, D. Q. Zhang, Lek Heng Ngoh, Wai-Choong ...
BMCBI
2010
149views more  BMCBI 2010»
14 years 10 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
VDA
2010
206views Visualization» more  VDA 2010»
15 years 5 days ago
Visual discovery in multivariate binary data
This paper presents the concept of Monotone Boolean Function Visual Analytics (MBFVA) and its application to the medical domain. The medical application is concerned with discover...
Boris Kovalerchuk, Florian Delizy, Logan Riggs, Ev...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
15 years 4 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...