1760 search results - page 102 / 352 » Connected Set Cover Problem and Its Applications |
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
JVM
2004
13 years 9 months ago
2004
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...