597 search results - page 15 / 120 » Dominating Distributions and Learnability |
118
Voted
IWDC
2005
Springer
15 years 6 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
120
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
The MPEG-7 dominant color descriptor (DCD) is an effective, compact, and intuitive representation of salient colors in an image region and is very useful for contentbased image re...
138
click to vote
MOBIHOC
2002
ACM
16 years 6 days ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
114
Voted
MASCOTS
2007
15 years 2 months ago
2007
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
117
click to vote
ML
2007
ACM
15 years 4 days ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...