Sciweavers

115 search results - page 11 / 23
» Generating All Sets With Bounded Unions
Sort
View
PODS
2012
ACM
281views Database» more  PODS 2012»
11 years 10 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
TCAD
2008
114views more  TCAD 2008»
13 years 7 months ago
Test-Quality/Cost Optimization Using Output-Deviation-Based Reordering of Test Patterns
At-speed functional testing, delay testing, and n-detection test sets are being used today to detect deep submicrometer defects. However, the resulting test data volumes are too hi...
Zhanglei Wang, Krishnendu Chakrabarty
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
INFOCOM
1998
IEEE
13 years 11 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
WG
2010
Springer
13 years 5 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...