Sciweavers

1464 search results - page 55 / 293
» On optimal anonymization for l -diversity
Sort
View
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 10 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
WSC
1998
15 years 7 months ago
Modeling Cardiac Ion Channel Conductivity: Model Fitting via Simulation
We describe a Markov state model for a cloned potassium channel of the human heart ( 1KvLQTI ). The parameters of the model are determined by a least-squares fit of predicted vs. ...
John L. Maryak, Richard H. Smith, Raimond L. Winsl...
ICMCS
2006
IEEE
188views Multimedia» more  ICMCS 2006»
16 years 9 days ago
Non-Bandlimited Resampling of Images
The resampling of discrete-time signals where the underlying analog signal is non-bandlimited is considered in this paper. We extend the generalized sampling theory developed base...
Beilei Huang, Edmund Ming-Kit Lai
IPPS
2003
IEEE
15 years 11 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
DISOPT
2008
82views more  DISOPT 2008»
15 years 6 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis