Sciweavers

2745 search results - page 464 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
EDBT
2009
ACM
166views Database» more  EDBT 2009»
15 years 9 months ago
Neighbor-based pattern detection for windows over streaming data
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
CODES
2009
IEEE
15 years 8 months ago
Minimization of the reconfiguration latency for the mapping of applications on FPGA-based systems
Field-Programmable Gate Arrays (FPGAs) have become promising mapping fabric for the implementation of System-on-Chip (SoC) platforms, due to their large capacity and their enhance...
Vincenzo Rana, Srinivasan Murali, David Atienza, M...
ICNP
1997
IEEE
15 years 8 months ago
On path selection for traffic with bandwidth guarantees
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Qingming Ma, Peter Steenkiste
RECOMB
2004
Springer
16 years 4 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
ICS
2007
Tsinghua U.
15 years 10 months ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau