Sciweavers

1243 search results - page 221 / 249
» Complexity reduction of C-Algorithm
Sort
View
ICS
2007
Tsinghua U.
16 years 1 days 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
TAMC
2007
Springer
16 years 13 hour ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
GLOBECOM
2006
IEEE
15 years 12 months ago
Interleaved Multistage Switching Fabrics for Scalable High Performance Routers
As the Internet grows exponentially, scalable high performance routers and switches on backbone are required to provide a large number of ports, higher throughput, lower delay late...
Rongsen He, José G. Delgado-Frias
INFOCOM
2006
IEEE
15 years 12 months ago
Scalable Clustering of Internet Paths by Shared Congestion
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
SBACPAD
2006
IEEE
147views Hardware» more  SBACPAD 2006»
15 years 12 months ago
Controlling the Power and Area of Neural Branch Predictors for Practical Implementation in High-Performance Processors
Neural-inspired branch predictors achieve very low branch misprediction rates. However, previously proposed implementations have a variety of characteristics that make them challe...
Daniel A. Jiménez, Gabriel H. Loh