1760 search results - page 61 / 352 » Connected Set Cover Problem and Its Applications |
145
click to vote
SIAMDM
2010
15 years 4 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...
271
click to vote
GIS
2011
ACM
14 years 9 months 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 ...
146
click to vote
MIDDLEWARE
2004
Springer
15 years 11 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...
118
click to vote
TROB
2010
15 years 4 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 (...
174
click to vote
CORR
2010
Springer
15 years 5 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...