Sciweavers

590 search results - page 15 / 118
» Can We Learn to Beat the Best Stock
Sort
View
EMNLP
2004
14 years 11 months ago
Automatic Paragraph Identification: A Study across Languages and Domains
In this paper we investigate whether paragraphs can be identified automatically in different languages and domains. We propose a machine learning approach which exploits textual a...
Caroline Sporleder, Mirella Lapata
AI
2000
Springer
14 years 9 months ago
Wrapper induction: Efficiency and expressiveness
The Internet presents numerous sources of useful information--telephone directories, product catalogs, stock quotes, event listings, etc. Recently, many systems have been built th...
Nicholas Kushmerick
EMNLP
2008
14 years 11 months ago
LTAG Dependency Parsing with Bidirectional Incremental Construction
In this paper, we first introduce a new architecture for parsing, bidirectional incremental parsing. We propose a novel algorithm for incremental construction, which can be applie...
Libin Shen, Aravind K. Joshi
80
Voted
IPPS
2007
IEEE
15 years 4 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
73
Voted
DIS
2008
Springer
14 years 11 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt