1464 search results - page 205 / 293 » On optimal anonymization for l -diversity |
177
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: This paper presents the use of Support Vector Machines (SVMs) for prediction and analysis of antisense oligonucleotide (AO) efficacy. The collected database comprises ...
204
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
159
click to vote
COCOON
2009
Springer
16 years 29 days ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
142
click to vote
EUROPAR
2005
Springer
15 years 12 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
156
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...