2107 search results - page 97 / 422 » Computing Small Search Numbers in Linear Time |
113
Voted
NIPS
2001
15 years 4 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
172
click to vote
ICPP
1995
IEEE
15 years 7 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
117
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
108
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
123
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...