50 search results - page 4 / 10 » Analyzing Co-training Style Algorithms |
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
PCM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Achievement of museum guide systems, in physical and virtual worlds, providing the personalization and context awareness features requires the prior analysis and identi...
PDPTA
1996
13 years 8 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...