4103 search results - page 764 / 821 » Some results on the Collatz problem |
167
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
179
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
142
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
The idea of conducting usability tests remotely emerged ten years ago. Since then, it has been studied empirically, and some software organizations employ remote methods. Yet ther...
253
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
217
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...