4103 search results - page 111 / 821 » Some results on the Collatz problem |
147
click to vote
HCI
2001
15 years 8 months ago
2001
This paper discusses possibilities and problems arising in the design of usable interactive systems when both visual and haptic interaction modes are available. Communicational an...
200
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
158
click to vote
JCT
2010
15 years 1 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
192
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
168
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...