Sciweavers

5100 search results - page 634 / 1020
» The Linear Complexity of a Graph
Sort
View
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
15 years 10 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
ARCS
2008
Springer
15 years 8 months ago
An Optimized ZGEMM Implementation for the Cell BE
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
Timo Schneider, Torsten Hoefler, Simon Wunderlich,...
CP
2008
Springer
15 years 8 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
MEDIAFORENSICS
2010
15 years 8 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
192
Voted
ACL
2006
15 years 8 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu