Sciweavers

107 search results - page 19 / 22
» A Statistical Theory of Dependency Syntax
Sort
View
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
14 years 11 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 1 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 1 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
MOBIHOC
2008
ACM
16 years 27 days ago
Toward stochastic anatomy of inter-meeting time distribution under general mobility models
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
Han Cai, Do Young Eun
ALT
2006
Springer
15 years 10 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen