Sciweavers

4908 search results - page 704 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
BMCBI
2005
306views more  BMCBI 2005»
15 years 6 months ago
A method for aligning RNA secondary structures and its application to RNA motif detection
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
Jianghui Liu, Jason Tsong-Li Wang, Jun Hu, Bin Tia...
CI
2002
92views more  CI 2002»
15 years 6 months ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
TEC
2002
161views more  TEC 2002»
15 years 6 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...