Sciweavers

11151 search results - page 27 / 2231
» On the Complexity of Model Expansion
Sort
View
NN
2000
Springer
165views Neural Networks» more  NN 2000»
13 years 7 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
CIKM
2004
Springer
14 years 28 days ago
A framework for selective query expansion
Query expansion is a well-known technique that has been shown to improve average retrieval performance. This technique has not been used in many operational systems because of the...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
WEBI
2010
Springer
13 years 5 months ago
Relations Expansion: Extracting Relationship Instances from the Web
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
Haibo Li, Yutaka Matsuo, Mitsuru Ishizuka
TC
1998
13 years 7 months ago
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
Germain Drolet