635 search results - page 3 / 127 » Some Computational Problems Related to Pseudo-intents |
121
click to vote
LPNMR
2011
Springer
14 years 10 days ago
2011
Springer
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
141
click to vote
CCA
2009
Springer
15 years 2 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
STRINGOLOGY
2008
14 years 11 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
CHI
2009
ACM
15 years 4 months ago
2009
ACM
This paper takes up the problem of understanding why we preserve some things passionately and discard others without thought. We briefly report on the theoretical literature relat...