4838 search results - page 226 / 968 » Sampling of information goods |
160
click to vote
SEFM
2008
IEEE
16 years 1 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
162
click to vote
ICIP
2007
IEEE
16 years 28 days ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
157
click to vote
ICTAI
2007
IEEE
16 years 28 days ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
159
click to vote
PCM
2007
Springer
16 years 22 days ago
2007
Springer
This paper develops a novel and efficient dimension reduction scheme--Fast Adaptive Discriminant Analysis (FADA). FADA can find a good projection with adaptation to different sampl...
170
click to vote
ICDM
2006
IEEE
16 years 20 days ago
2006
IEEE
In active learning, a machine learning algorithm is given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. ...