Sciweavers

2006 search results - page 242 / 402
» Heuristic Security-Testing Methods
Sort
View
167
Voted
BMCBI
2011
14 years 4 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
133
Voted
CGF
2011
14 years 4 months ago
Estimating Color and Texture Parameters for Vector Graphics
Diffusion curves are a powerful vector graphic representation that stores an image as a set of 2D Bezier curves with colors defined on either side. These colors are diffused over...
Stefan Jeschke, David Cline, Peter Wonka
145
Voted
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
14 years 4 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
130
Voted
CCS
2011
ACM
14 years 1 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
132
Voted
AAMAS
2012
Springer
13 years 8 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...