Sciweavers

2018 search results - page 154 / 404
» Magnitude-preserving ranking algorithms
Sort
View
IJCAI
2003
15 years 7 months ago
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Information extraction (IE) aims at extracting specific information from a collection of documents. A lot of previous work on 10 from semi-structured documents (in XML or HTML) us...
Raymond Kosala, Maurice Bruynooghe, Jan Van den Bu...
CORR
2006
Springer
71views Education» more  CORR 2006»
15 years 6 months ago
Using NLP to build the hypertextuel network of a back-of-the-book index
Relying on the idea that back-of-the-book indexes are traditional devices for navigation through large documents, we have developed a method to build a hypertextual network that h...
Touria Aït El Mekki, Adeline Nazarenko
INFOCOM
2008
IEEE
16 years 24 days ago
Fair Scheduling through Packet Election
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
Srikanth Jagabathula, Vishal Doshi, Devavrat Shah
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
16 years 16 days ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles
NIPS
1997
15 years 7 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer