Sciweavers

1693 search results - page 65 / 339
» fast 2008
Sort
View
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 8 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
SIGOPS
2008
104views more  SIGOPS 2008»
13 years 8 months ago
PipesFS: fast Linux I/O in the unix tradition
This paper presents PipesFS, an I/O architecture for Linux 2.6 that increases I/O throughput and adds support for heterogeneous parallel processors by (1) collapsing many I/O inte...
Willem de Bruijn, Herbert Bos
TCSV
2008
153views more  TCSV 2008»
13 years 8 months ago
Broadcast Court-Net Sports Video Analysis Using Fast 3-D Camera Modeling
This paper addresses the automatic analysis of court-net sports video content. We extract information about the players, the playing-field in a bottom-up way until we reach scene-l...
Jungong Han, Dirk Farin, Peter H. N. de With
TIT
2008
103views more  TIT 2008»
13 years 8 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TIT
2008
74views more  TIT 2008»
13 years 8 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz