8647 search results - page 134 / 1730 » The Container Selection Problem |
121
click to vote
IJISEC
2006
15 years 3 months ago
2006
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
155
click to vote
JGAA
2007
15 years 3 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
145
click to vote
LOGCOM
2002
15 years 2 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
107
click to vote
SIGIR
2002
ACM
15 years 2 months ago
2002
ACM
We compare standard global IR searching with user-centric localized techniques to address the database selection problem. We conduct a series of experiments to compare the retriev...
122
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...