Sciweavers

3146 search results - page 237 / 630
» Efficient Consequence Finding
Sort
View
IJISEC
2008
108views more  IJISEC 2008»
15 years 6 months ago
A note on the Ate pairing
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
Changan Zhao, Fangguo Zhang, Jiwu Huang
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 6 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
IPL
2006
84views more  IPL 2006»
15 years 6 months ago
On the hardness of approximating Max-Satisfy
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
Uriel Feige, Daniel Reichman
JMLR
2006
79views more  JMLR 2006»
15 years 6 months ago
Estimation of Gradients and Coordinate Covariation in Classification
We introduce an algorithm that simultaneously estimates a classification function as well as its gradient in the supervised learning framework. The motivation for the algorithm is...
Sayan Mukherjee, Qiang Wu
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
15 years 6 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx