10988 search results - page 369 / 2198 » Algorithmic Folding Complexity |
132
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
160
click to vote
TSMC
2008
15 years 4 months ago
2008
Abstract--Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security sy...
153
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
150
Voted
JGAA
2006
15 years 4 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
159
click to vote
JUCS
2006
15 years 4 months ago
2006
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...