9572 search results - page 231 / 1915 » Cover Algorithms and Their Combination |
166
click to vote
ACSC
2005
IEEE
16 years 4 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
120
click to vote
COLING
1996
15 years 7 months ago
1996
This paper proposes a new algorithm that simultaneously identifies the coding system and language of a code string fetched from the Internet, especially World-Wide Web. The algori...
148
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
151
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
160
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...