Sciweavers

755 search results - page 2 / 151
» Reducing Kernel Development Complexity in Distributed Enviro...
Sort
View
NECO
2010
97views more  NECO 2010»
13 years 3 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ICDCS
1991
IEEE
13 years 8 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
ICCD
2003
IEEE
111views Hardware» more  ICCD 2003»
14 years 2 months ago
Reducing Operand Transport Complexity of Superscalar Processors using Distributed Register Files
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
Santithorn Bunchua, D. Scott Wills, Linda M. Wills
IPPS
1999
IEEE
13 years 9 months ago
An Approach for Measuring IP Security Performance in a Distributed Environment
Abstract. The Navy needs to use Multi Level Security (MLS) techniques in an environment with increasing amount of real time computation brought about by increased automation requir...
Brett L. Chappell, David T. Marlow, Philip M. Irey...
IPPS
1998
IEEE
13 years 9 months ago
A Development Tool Environment for Configuration, Build, and Launch of Complex Applications
The increasing size and complexity of high-performance applications have motivated a new round of innovation related to configuration, build, and launch of applications for large ...
Mike Krueger