4865 search results - page 305 / 973 » The Complexity of Graph Connectivity |
172
click to vote
SIGIR
2006
ACM
16 years 19 days ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
194
click to vote
CASES
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
183
click to vote
VIZSEC
2005
Springer
16 years 4 days ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
173
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
153
click to vote
CCS
2007
ACM
16 years 26 days ago
2007
ACM
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...