11565 search results - page 1968 / 2313 » Computing Minimal Mappings |
152
click to vote
AAAI
2006
15 years 8 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
194
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a novel framework for multi-label learning that explicitly addresses the challenge arising from the large number of classes and a small size of training data. The key a...
166
Voted
BIOCOMP
2006
15 years 8 months ago
2006
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...
160
click to vote
DLT
2006
15 years 8 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
184
click to vote
CATA
2003
15 years 8 months ago
2003
In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize...