Sciweavers

1093 search results - page 10 / 219
» Fast Abstracts
Sort
View
EOR
2002
79views more  EOR 2002»
13 years 7 months ago
Fast fully polynomial approximation schemes for minimizing completion time variance
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...
DTJ
1998
66views more  DTJ 1998»
13 years 7 months ago
DART: Fast Application-level Networking via Data-copy Avoidance
the window scaling extension, to abstractly support the advertisement of more than 64 kbytes of receive buffering. The rest of the improvements derived from implementation efforts ...
Robert J. Walsh
VLDB
2002
ACM
112views Database» more  VLDB 2002»
13 years 7 months ago
Fast and Accurate Text Classification via Multiple Linear Discriminant Projections
Abstract. Support vector machines (SVMs) have shown superb performance for text classification tasks. They are accurate, robust, and quick to apply to test instances. Their only po...
Soumen Chakrabarti, Shourya Roy, Mahesh V. Soundal...
ICC
2007
IEEE
14 years 1 months ago
A Cube Oriented Ray Launching Algorithm for 3D Urban Field Strength Prediction
Abstract— Fast radio wave propagation prediction is of tremendous interest for planning and optimization of cellular radio networks. We propose a cube oriented 3D ray launching a...
Rudolf Mathar, Michael Reyer, Michael Schmeink
EUROCRYPT
1999
Springer
13 years 12 months ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson