1760 search results - page 61 / 352 » Connected Set Cover Problem and Its Applications |
SIAMDM
2010
13 years 7 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
GIS
2011
ACM
13 years 14 days ago
2011
ACM
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
MIDDLEWARE
2004
Springer
14 years 2 months ago
2004
Springer
The very nature of implementing and evaluating fully distributed algorithms or protocols in application-layer overlay networks involves certain programming tasks that are at best m...
TROB
2010
13 years 7 months ago
2010
—We propose a novel framework, passive set-position modulation (PSPM), which enables us to connect a (continuoustime) robot’s position to a sequence of slowly-updating/sparse (...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...