Sciweavers

1523 search results - page 91 / 305
» The Computational Complexity of Linear Optics
Sort
View
IJCNLP
2005
Springer
14 years 2 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...
EUROCRYPT
2001
Springer
14 years 1 months ago
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
Liam Keliher, Henk Meijer, Stafford E. Tavares
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
BMCBI
2010
218views more  BMCBI 2010»
13 years 6 months ago
A hybrid blob-slice model for accurate and efficient detection of fluorescence labeled nuclei in 3D
Background: To exploit the flood of data from advances in high throughput imaging of optically sectioned nuclei, image analysis methods need to correctly detect thousands of nucle...
Anthony Santella, Zhuo Du, Sonja Nowotschin, Anna-...
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
14 years 20 days ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama