Sciweavers

1566 search results - page 137 / 314
» On a Cone Covering Problem
Sort
View
ICCD
2004
IEEE
113views Hardware» more  ICCD 2004»
16 years 1 months ago
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
Sule Ozev, Alex Orailoglu
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
15 years 11 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
CGI
2004
IEEE
15 years 8 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
IPM
2006
83views more  IPM 2006»
15 years 4 months ago
A risk minimization framework for information retrieval
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
ChengXiang Zhai, John D. Lafferty

Lecture Notes
2225views
17 years 3 months ago
Microeconomics
The main objective of the course is for students to be able to analyze problems in microeconomic theory at the beginning graduate level. Students successfully completing the course...
Arne Hallam