6274 search results - page 421 / 1255 » From query complexity to computational complexity |
146
click to vote
ISSAC
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
196
click to vote
ARTS
1999
Springer
15 years 11 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
121
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
This workshop explores the territory of `value-centred HCI' with the intention of freeing us from the tricky complexity of this topic and the multiple meanings of the words `...
176
click to vote
MOC
2000
15 years 6 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
167
click to vote
NAACL
2010
15 years 4 months ago
2010
In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex ...