4103 search results - page 718 / 821 » Some results on the Collatz problem |
170
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
199
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
155
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
185
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
157
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...