Sciweavers

4908 search results - page 311 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ISQED
2006
IEEE
107views Hardware» more  ISQED 2006»
16 years 22 days ago
On Optimizing Scan Testing Power and Routing Cost in Scan Chain Design
— With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC desi...
Li-Chung Hsu, Hung-Ming Chen
ESA
2005
Springer
107views Algorithms» more  ESA 2005»
16 years 8 days ago
Workload-Optimal Histograms on Streams
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
S. Muthukrishnan, Martin Strauss, X. Zheng
185
Voted
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 11 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 11 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals