2681 search results - page 258 / 537 » Problem F |
188
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
159
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
215
click to vote
ICCSA
2007
Springer
15 years 8 months ago
2007
Springer
A style dress outlet usually purchases products from multiple suppliers with different cost, quality and selling price. It is assumed that some suppliers will sell their goods to t...
131
click to vote
SEC
2008
15 years 8 months ago
2008
We examine the problem of protecting online banking accounts from password brute-forcing attacks. Our method is to create a large number of honeypot userID-password pairs. Presenta...
193
click to vote
ACSW
2004
15 years 8 months ago
2004
In data clustering, many approaches have been proposed such as K-means method and hierarchical method. One of the problems is that the results depend heavily on initial values and...