12052 search results - page 434 / 2411 » computing 2010 |
177
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
196
click to vote
CIE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
145
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
The two parts of this paper consider combinatorial and geometric aspects of semibent functions. In the first part of this note we obtain 2
161
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The Traveling Salesman Problem Under Squared Euclidean Distances
148
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Dictionary-based disambiguation (DBD) is a very popular solution for text entry on mobile phone keypads but suffers