Sciweavers

168 search results - page 8 / 34
» et 1998
Sort
View
ANLP
2000
123views more  ANLP 2000»
13 years 9 months ago
Noun Phrase Recognition by System Combination
The performance of machine learning algorithms can be improved by combining the output of different systems. In this paper we apply this idea to the recognition of noun phrases. W...
Erik F. Tjong Kim Sang
AAAI
1998
13 years 9 months ago
Boosting Combinatorial Search Through Randomization
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
Carla P. Gomes, Bart Selman, Henry A. Kautz
AAAI
1998
13 years 9 months ago
Knowledge Intensive Exception Spaces
In this paper we extend the concept of exception spaces as defined by Cost and Salzberg (Cost and Salzberg, 1993), in the context of exemplar-based reasoning. Cost et al. defined ...
Sarabjot S. Anand, David W. Patterson, John G. Hug...
IJNSEC
2006
75views more  IJNSEC 2006»
13 years 7 months ago
Cryptanalysis of the Secure Sessions from Weak Secrets Protocols
The Short Secret Sharing Protocols (S3P), proposed by Roe et al in 1998 [13] and revised in 2003 [14], is a family of protocols that bootstrap secure session keys from weak secret...
Jolyon Clulow
ORL
1998
136views more  ORL 1998»
13 years 7 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...