Sciweavers

1568 search results - page 178 / 314
» The problem of examination questions in algorithmics
Sort
View
CCS
2007
ACM
15 years 10 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...
WINE
2007
Springer
151views Economy» more  WINE 2007»
16 years 15 days ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 10 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
AIIA
2007
Springer
15 years 8 months ago
Tonal Harmony Analysis: A Supervised Sequential Learning Approach
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...
Daniele P. Radicioni, Roberto Esposito