Sciweavers

903 search results - page 122 / 181
» On the reduction of a random basis
Sort
View
FUIN
2006
85views more  FUIN 2006»
15 years 6 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
CCR
2007
86views more  CCR 2007»
15 years 6 months ago
JumboGen: dynamic jumbo frame generation for network performance scalability
Network line speeds have increased at a significant rate. Unfortunately, network performance has not been able to keep pace with increases in line speed. This is due to the major...
David Salyers, Yingxin Jiang, Aaron Striegel, Chri...
TCS
2008
15 years 6 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
IPM
2007
113views more  IPM 2007»
15 years 6 months ago
Two uses of anaphora resolution in summarization
We propose a new method for using anaphoric information in Latent Semantic Analysis (lsa), and discuss its application to develop an lsa-based summarizer which achieves a signifi...
Josef Steinberger, Massimo Poesio, Mijail Alexandr...
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 4 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger