3874 search results - page 224 / 775 » Approximation Algorithms for k-hurdle Problems |
149
click to vote
SECURWARE
2008
IEEE
15 years 10 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
120
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
226
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
136
Voted
DAWAK
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
135
click to vote
CORR
2010
Springer
15 years 2 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...