1864 search results - page 152 / 373 » Formal topology and domains |
164
click to vote
UAI
1996
15 years 7 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
177
click to vote
IOR
2008
15 years 6 months ago
2008
Wireless sensor networks pose numerous fundamental coordination problems. For instance, in a number of application domains including homeland security, environmental monitoring an...
164
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
193
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
The complex interactions appearing in service-oriented computing make coordination a key concern in serviceoriented systems. In this paper, we present a fault-based method to gene...
165
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...