Sciweavers

308 search results - page 48 / 62
» Tight Lower Bounds for the Distinct Elements Problem
Sort
View
SOFSEM
2012
Springer
14 years 2 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 21 days ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
155
Voted
IMR
2005
Springer
16 years 2 days ago
An Interior Surface Generation Method for All-Hexahedral Meshing
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...
Tatsuhiko Suzuki, Shigeo Takahashi, Jason Shepherd
ICCAD
2003
IEEE
158views Hardware» more  ICCAD 2003»
16 years 3 months ago
Approaching the Maximum Energy Saving on Embedded Systems with Multiple Voltages
Dynamic voltage scaling (DVS) is arguably the most effective energy reduction technique. The multiple-voltage DVS systems, which can operate only at pre-determined discrete voltag...
Shaoxiong Hua, Gang Qu