266 search results - page 34 / 54 » Dependence relations in computably rigid computable vector s... |
COMPUTING
2006
13 years 8 months ago
2006
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
TCS
2008
13 years 8 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...