Sciweavers

2763 search results - page 115 / 553
» The Dangerous 'All' in Specifications
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 11 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CCS
2008
ACM
13 years 11 months ago
Towards an efficient and language-agnostic compliance checker for trust negotiation systems
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...
Adam J. Lee, Marianne Winslett
CVPR
2007
IEEE
14 years 11 months ago
Color Constancy using Natural Image Statistics
Although many color constancy methods exist, they are all based on specific assumptions such as the set of possible light sources, or the spatial and spectral characteristics of i...
Arjan Gijsenij, Theo Gevers
ECCV
2006
Springer
14 years 11 months ago
Sampling Representative Examples for Dimensionality Reduction and Recognition - Bootstrap Bumping LDA
Abstract. We present a novel method for dimensionality reduction and recognition based on Linear Discriminant Analysis (LDA), which specifically deals with the Small Sample Size (S...
Hui Gao, James W. Davis