2745 search results - page 363 / 549 » A fast algorithm for computing large Fibonacci numbers |
146
Voted
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
141
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
119
Voted
IJRR
2008
15 years 5 months ago
2008
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
155
Voted
JODL
2006
15 years 5 months ago
2006
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
199
Voted
FSE
2011
Springer
14 years 8 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...