4103 search results - page 594 / 821 » Some results on the Collatz problem |
162
click to vote
MST
2006
15 years 6 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
181
click to vote
JCT
2010
15 years 4 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
197
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
174
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
158
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
—Rate adaptation, as a challenging issue for wireless purpose. Relatively little attention has been paid on identifying network design, has been an active research topic for year...