923 search results - page 97 / 185 » Proving the value of formal methods |
161
click to vote
EOR
2006
15 years 6 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
176
click to vote
CIARP
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. Gender recognition problem has not been extensively studied in situations where the face cannot be accurately detected and it also can be partially occluded. In this cont...
149
click to vote
AISC
2004
Springer
15 years 11 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
109
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g.,...
185
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...