36 search results - page 3 / 8 » Fast Node Overlap Removal |
SIAMSC
2008
13 years 7 months ago
2008
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
CISS
2007
IEEE
14 years 1 months ago
2007
IEEE
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
ICSE
2001
IEEE-ACM
13 years 11 months ago
2001
IEEE-ACM
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...