Sciweavers

136 search results - page 25 / 28
» Experimental Study of Minimum Cut Algorithms
Sort
View
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
15 years 9 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 3 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
RCIS
2010
14 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
BMCBI
2005
147views more  BMCBI 2005»
14 years 9 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...
CODES
2003
IEEE
15 years 3 months ago
Design space minimization with timing and code size optimization for embedded DSP
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
Qingfeng Zhuge, Zili Shao, Bin Xiao, Edwin Hsing-M...