Sciweavers

429 search results - page 24 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 6 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
IEEEICCI
2003
IEEE
15 years 11 months ago
Automatic Concept Evolution
An evolutionary algorithm can be used by a distributed group of interacting people to produce the solution to a problem. First the problem must be defined. Each member of the grou...
Terence C. Fogarty
CATA
2010
15 years 7 months ago
Mixed-criticality Scheduling: Improved Resource-augmentation Results
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
Sanjoy K. Baruah, Haohan Li, Leen Stougie
ICCS
2009
Springer
15 years 3 months ago
Gene Specific Co-regulation Discovery: An Improved Approach
Abstract. Discovering gene co-regulatory relationships is a new but important research problem in DNA microarray data analysis. The problem of gene specific co-regulation discovery...
Ji Zhang, Qing Liu, Kai Xu 0003
DAC
1989
ACM
15 years 10 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong