Sciweavers

16430 search results - page 504 / 3286
» On Computable Tree Functions
Sort
View
IFIP12
2008
15 years 8 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
PDPTA
2007
15 years 8 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
IJCAI
1997
15 years 8 months ago
Machine Learning Techniques to Make Computers Easier to Use
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Hiroshi Motoda, Kenichi Yoshida
PC
2010
111views Management» more  PC 2010»
15 years 5 months ago
Reducing complexity in tree-like computer interconnection networks
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...
Javier Navaridas, José Miguel-Alonso, Franc...
ISVC
2009
Springer
16 years 1 months ago
Optimal Weights for Convex Functionals in Medical Image Segmentation
Energy functional minimization is a popular technique for medical image segmentation. The segmentation must be initialized, weights for competing terms of an energy functional must...
Chris McIntosh, Ghassan Hamarneh