2957 search results - page 341 / 592 » The Complexity of Polynomial-Time Approximation |
174
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
168
click to vote
IJCNN
2006
IEEE
16 years 18 days ago
2006
IEEE
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
160
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
187
click to vote
AMR
2005
Springer
16 years 4 days ago
2005
Springer
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
167
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...