14649 search results - page 2703 / 2930 » Principles of problem solving |
201
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
225
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
197
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
302
click to vote
SPAA
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
213
click to vote
TMC
2012
13 years 9 months ago
2012
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...