Sciweavers

2976 search results - page 189 / 596
» On the bounded integer programming
Sort
View
KBSE
2007
IEEE
16 years 22 days ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
COCOON
2005
Springer
15 years 12 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
DAGSTUHL
2008
15 years 8 months ago
Real Algebraic Numbers: Complexity Analysis and Experimentation
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
EM
2010
121views Management» more  EM 2010»
15 years 6 months ago
Self-Intersection Numbers of Curves on the Punctured Torus
On the punctured torus the number of essential self-intersections of a homotopy class of closed curves is bounded (sharply) by a quadratic function of its combinatorial length (th...
Moira Chas, Anthony Phillips
TIT
1998
79views more  TIT 1998»
15 years 6 months ago
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
Chuanyi Ji, Demetri Psaltis