Sciweavers

16843 search results - page 381 / 3369
» On Generalized Authorization Problems
Sort
View
SPAA
2004
ACM
16 years 4 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CIKM
2009
Springer
15 years 11 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
CCS
2006
ACM
15 years 10 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
JAIR
2006
90views more  JAIR 2006»
15 years 6 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
ATAL
2011
Springer
14 years 6 months ago
Information elicitation for decision making
Proper scoring rules, particularly when used as the basis for a prediction market, are powerful tools for eliciting and aggregating beliefs about events such as the likely outcome...
Yiling Chen, Ian A. Kash