2745 search results - page 40 / 549 » A fast algorithm for computing large Fibonacci numbers |
175
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
143
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
159
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
154
Voted
CGI
1998
IEEE
15 years 10 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
163
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...