1026 search results - page 31 / 206 » On Finding Minimal w-cutset |
WADS
1997
Springer
14 years 1 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
DLT
2006
13 years 10 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
ACHI
2008
IEEE
14 years 3 months ago
2008
IEEE
—We present a 3D anatomically guided diagnostic system to detect internal bleeding of patients in the field. Our solution employs high fidelity digital human models to help medic...
SIGIR
1992
ACM
14 years 1 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...