Sciweavers

1376 search results - page 269 / 276
» Searching Trees: An Essay
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CPAIOR
2008
Springer
14 years 11 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
LREC
2010
180views Education» more  LREC 2010»
14 years 11 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
EMNLP
2007
14 years 11 months ago
Syntactic Re-Alignment Models for Machine Translation
We present a method for improving word alignment for statistical syntax-based machine translation that employs a syntactically informed alignment model closer to the translation m...
Jonathan May, Kevin Knight
ICMLA
2008
14 years 11 months ago
Comparison with Parametric Optimization in Credit Card Fraud Detection
We apply five classification methods, Neural Nets(NN), Bayesian Nets(BN), Naive Bayes(NB), Artificial Immune Systems(AIS) [4] and Decision Trees(DT), to credit card fraud detectio...
Manoel Fernando Alonso Gadi, Xidi Wang, Alair Pere...