220 search results - page 36 / 44 » Distributed Minimum Cut Approximation |
PKDD
1999
Springer
14 years 2 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
ICC
2009
IEEE
13 years 7 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
GIS
2007
ACM
14 years 11 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
MOBIHOC
2005
ACM
14 years 9 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
GIS
2005
ACM
14 years 10 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...