Sciweavers

276 search results - page 25 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
IJCNLP
2005
Springer
14 years 1 months ago
Using Multiple Discriminant Analysis Approach for Linear Text Segmentation
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
Jingbo Zhu, Na Ye, Xinzhi Chang, Wenliang Chen, Be...
TCS
2008
13 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 7 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
ARITH
2001
IEEE
13 years 11 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee
JCB
2008
91views more  JCB 2008»
13 years 7 months ago
Computational Quantification of Peptides from LC-MS Data
Liquid chromatography coupled to mass spectrometry (LC-MS) has become a major tool for the study of biological processes. High-throughput LC-MS experiments are frequently conducte...
Ole Schulz-Trieglaff, Rene Hussong, Clemens Gr&oum...