738 search results - page 67 / 148 » cases 2001 |
NIPS
2001
14 years 11 months ago
2001
The rule-based bootstrapping introduced by Yarowsky, and its cotraining variant by Blum and Mitchell, have met with considerable empirical success. Earlier work on the theory of c...
WSC
2004
14 years 11 months ago
2004
Data Farming leverages high performance computing to run simple models many times. This process allows for the exploration of massive parameter spaces relatively quickly. This pap...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
UML
2001
Springer
15 years 2 months ago
2001
Springer
: This paper introduces the Calculating with Concepts (CC) technique, which has been developed to improve the precision of UML class diagrams and allows the formal reasoning based ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...