Sciweavers

1969 search results - page 269 / 394
» Financial Theory 1
Sort
View
FSTTCS
2006
Springer
14 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
GFKL
2006
Springer
89views Data Mining» more  GFKL 2006»
14 years 1 months ago
The Relationship of Word Length and Sentence Length: The Inter-Textual Perspective
The present study concentrates on the relation between sentence length (SL) and word length (WL) as a possible factor in text classification. The dependence of WL and SL is discuss...
Peter Grzybek, Ernst Stadlober, Emmerich Kelih
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 1 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
CHI
1995
ACM
14 years 1 months ago
Integrating multiple cues for spoken language understanding
As spoken language interfaces for real-world systems become a practical possibility, it has become apparent that such interfaces will need to draw on a variety of cues from divers...
Karen Ward, David G. Novick
COMPGEOM
1995
ACM
14 years 1 months ago
Approximate Range Searching
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
Sunil Arya, David M. Mount