1511 search results - page 148 / 303 » On the effectiveness of address-space randomization |
PAKDD
2010
ACM
14 years 26 days ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
IPPS
2000
IEEE
14 years 14 days ago
2000
IEEE
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
SIBGRAPI
1999
IEEE
14 years 11 days ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
VISUALIZATION
1996
IEEE
14 years 7 days ago
1996
IEEE
This paper presents a novel approach to assist the user in exploring appropriate transfer functions for the visualization of volumetric datasets. The search for a transfer functio...
GCB
1997
Springer
14 years 7 days ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....