15 search results - page 2 / 3 » Timestamping Algorithms: A Characterization and a Few Proper... |
COCO
1994
Springer
13 years 9 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
PAMI
2007
13 years 4 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
WAW
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
JMLR
2010
13 years 23 hour ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
BMCBI
2010
13 years 5 months ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...