Sciweavers

8486 search results - page 1629 / 1698
» Ordered Enumeration Method
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 2 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
14 years 2 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
EURODAC
1994
IEEE
209views VHDL» more  EURODAC 1994»
14 years 2 months ago
MOS VLSI circuit simulation by hardware accelerator using semi-natural models
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
Victor V. Denisenko
ECCV
2010
Springer
14 years 2 months ago
Predicting Facial Beauty without Landmarks
A fundamental task in artificial intelligence and computer vision is to build machines that can behave like a human in recognizing a broad range of visual concepts. This paper aims...
SIGGRAPH
1993
ACM
14 years 2 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
« Prev « First page 1629 / 1698 Last » Next »