Sciweavers

3415 search results - page 381 / 683
» Lower bounds on kernelization
Sort
View
IPPS
2007
IEEE
16 years 29 days ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
LCTRTS
2005
Springer
16 years 4 days ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
PPSWR
2004
Springer
16 years 11 hour ago
Calendrical Calculations with Time Partitionings and Fuzzy Time Intervals
This paper presents a piece in a big mosaic which consists of formalisms and software packages for representing and reasoning with everyday temporal notions. The kernel of the mosa...
Hans Jürgen Ohlbach
146
Voted
NCA
2003
IEEE
15 years 12 months ago
Kernel-based Web switches providing content-aware routing
Locally distributed Web server systems represent a costeffective solution to the performance problems due to high traffic volumes reaching popular Web sites. In this paper, we fo...
Mauro Andreolini, Michele Colajanni, Marcello Nucc...
CONEXT
2008
ACM
15 years 8 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford