194 search results - page 31 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
110
Voted
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
109
click to vote
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
110
click to vote
PKDD
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
128
click to vote
NIPS
2000
15 years 1 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
88
Voted
APSEC
2006
IEEE
15 years 6 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...