Sciweavers

3628 search results - page 338 / 726
» The Decision Diffie-Hellman Problem
Sort
View
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
16 years 6 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
DCC
2008
IEEE
16 years 6 months ago
An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation
Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency a...
Zhen Li, Alexis Michael Tourapis
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
16 years 3 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song
ICCAD
2003
IEEE
111views Hardware» more  ICCAD 2003»
16 years 3 months ago
A Trade-off Oriented Placement Tool
High quality placement results are always produced at the cost of significant runtimes. In this paper, we study the trade-off between the overall quality and the runtime for stand...
Huaiyu Xu, Maogang Wang, Bo-Kyung Choi, Majid Sarr...
ICFCA
2010
Springer
16 years 1 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel