Sciweavers

4114 search results - page 151 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
185
Voted
IFIP12
2008
15 years 7 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
DCC
2006
IEEE
15 years 9 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
15 years 8 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison
BIOCOMP
2006
15 years 7 months ago
A New Algorithm to Predict the Active Sites Using Amino Acid Vectors and Biochemical features of Surface Patches
: It is a very active research field to predict protein functions and active sites by protein surface patches. It is especially challengeable to predict the active sites by structu...
Sunshin Kim, Chung Rhee, Jungdo Choi, Yong Je Chun...
DAM
1999
128views more  DAM 1999»
15 years 5 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano