10148 search results - page 1992 / 2030 » Optimal sub-graphical models |
134
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
132
click to vote
DNA
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
106
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
143
click to vote
COLT
1995
Springer
15 years 7 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
137
click to vote
IDMS
1997
Springer
15 years 7 months ago
1997
Springer
With the evolving availability of wireless communication servicesand of affordable mobile devices such as notebooks or Personal Digital Assistants, mobile computing is becoming wid...