Sciweavers

363 search results - page 42 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
DIS
2010
Springer
13 years 5 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
DCC
2011
IEEE
13 years 2 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
CEC
2010
IEEE
13 years 5 months ago
EDDIE for investment opportunities forecasting: Extending the search space of the GP
Abstract-- In this paper we present a new version of a GPbased financial forecasting tool called EDDIE. The novelty of this new version (EDDIE 8), is its enlarged search space, whe...
Michael Kampouridis, Edward Tsang
BMCBI
2006
148views more  BMCBI 2006»
13 years 7 months ago
Exploiting the full power of temporal gene expression profiling through a new statistical test: Application to the analysis of m
Background: The identification of biologically interesting genes in a temporal expression profiling dataset is challenging and complicated by high levels of experimental noise. Mo...
Veronica Vinciotti, Xiaohui Liu, Rolf Turk, Emile ...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro