Sciweavers

14761 search results - page 2566 / 2953
» Optimization in Data Mining
Sort
View
SPAA
2009
ACM
16 years 3 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
CGO
2010
IEEE
16 years 1 months ago
Exploiting statistical correlations for proactive prediction of program behaviors
This paper presents a finding and a technique on program behavior prediction. The finding is that surprisingly strong statistical correlations exist among the behaviors of diffe...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Feng Mao, ...
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
16 years 1 months ago
Achieving 10 Gb/s using safe and transparent network interface virtualization
: © Achieving 10 Gb/s using Safe and Transparent Network Interface Virtualization Kaushik Kumar Ram, Jose Renato Santos, Yoshio Turner, Alan L. Cox, Scott Rixner HP Laboratories H...
Kaushik Kumar Ram, Jose Renato Santos, Yoshio Turn...
IPPS
2009
IEEE
16 years 1 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
BROADNETS
2007
IEEE
16 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
« Prev « First page 2566 / 2953 Last » Next »