1170 search results - page 34 / 234 » How Fast Is Too Fast |
113
Voted
CSDA
2006
15 years 1 months ago
2006
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
112
click to vote
MOC
2011
14 years 8 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
93
Voted
COMCOM
2007
15 years 1 months ago
2007
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
101
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
95
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...