Sciweavers

794 search results - page 76 / 159
» Improved algorithms for orienteering and related problems
Sort
View
DCC
2007
IEEE
14 years 8 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...
VLDB
1998
ACM
95views Database» more  VLDB 1998»
14 years 1 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
14 years 2 months ago
A multi-objective evolutionary approach to peptide structure redesign and stabilization
The prediction of the native structures of proteins, the socalled protein folding problem, is a NP hard multi-minima optimization problem for which to date no routine solutions ex...
Tim Hohm, Daniel Hoffmann
ECAI
2006
Springer
14 years 21 days ago
Phonetic Spelling and Heuristic Search
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
Benno Stein, Daniel Curatolo
EMNLP
2010
13 years 7 months ago
Confidence in Structured-Prediction Using Confidence-Weighted Models
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...
Avihai Mejer, Koby Crammer