Sciweavers

1059 search results - page 181 / 212
» The PISAB Question Answering System
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
SACMAT
2009
ACM
14 years 3 months ago
Symbolic reachability analysis for parameterized administrative role based access control
Role based access control (RBAC) is a widely used access control paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role ba...
Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C....
SIGIR
2009
ACM
14 years 3 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease
SIGIR
2009
ACM
14 years 3 months ago
Risky business: modeling and exploiting uncertainty in information retrieval
Most retrieval models estimate the relevance of each document to a query and rank the documents accordingly. However, such an approach ignores the uncertainty associated with the ...
Jianhan Zhu, Jun Wang, Ingemar J. Cox, Michael J. ...
SIGMETRICS
2009
ACM
134views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
DRAM errors in the wild: a large-scale field study
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich ...