7129 search results - page 950 / 1426 » Approximation Algorithms for Treewidth |
136
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
137
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
171
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
133
click to vote
ICCAD
2001
IEEE
16 years 1 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
152
click to vote
WABI
2009
Springer
15 years 11 months ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...