2745 search results - page 218 / 549 » A fast algorithm for computing large Fibonacci numbers |
168
click to vote
FAST
2004
15 years 5 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
171
click to vote
HIPC
2009
Springer
15 years 2 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
133
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
152
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
137
click to vote
JMLR
2010
14 years 11 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...