Sciweavers

21324 search results - page 256 / 4265
» Making the case for computing
Sort
View
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 5 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter
ACL
2011
14 years 7 months ago
Can Document Selection Help Semi-supervised Learning? A Case Study On Event Extraction
Annotating training data for event extraction is tedious and labor-intensive. Most current event extraction tasks rely on hundreds of annotated documents, but this is often not en...
Shasha Liao, Ralph Grishman
ACL
2012
13 years 6 months ago
Unsupervized Word Segmentation: the Case for Mandarin Chinese
In this paper, we present an unsupervized segmentation system tested on Mandarin Chinese. Following Harris's Hypothesis in Kempe (1999) and Tanaka-Ishii's (2005) reformu...
Pierre Magistry, Benoît Sagot
SAB
2010
Springer
110views Optimization» more  SAB 2010»
15 years 2 months ago
How to Pick the Right One: Investigating Tradeoffs among Female Mate Choice Strategies in Treefrogs
Two main theories of female mate choice, that females either pick the best from the n closest males (best-of-n) or the closest with some minimum quality (min-threshold), make diffe...
Matthias Scheutz, Jack Harris, Sunny K. Boyd
134
Voted
PDP
2010
IEEE
15 years 9 months ago
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....