Sciweavers

4377 search results - page 736 / 876
» Mass problems and randomness
Sort
View
IJCAI
2007
14 years 11 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
IJCAI
2007
14 years 11 months ago
Locating Complex Named Entities in Web Text
Named Entity Recognition (NER) is the task of locating and classifying names in text. In previous work, NER was limited to a small number of predefined entity classes (e.g., peop...
Doug Downey, Matthew Broadhead, Oren Etzioni
NETWORKING
2008
14 years 11 months ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...
NETWORKING
2007
14 years 11 months ago
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
Benoit Donnet, Bradley Huffaker, Timur Friedman, K...
AAAI
2004
14 years 11 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...