Sciweavers

130 search results - page 8 / 26
» A New Change of Variables for Efficient BRDF Representation
Sort
View
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ALMOB
2007
155views more  ALMOB 2007»
13 years 7 months ago
Finding coevolving amino acid residues using row and column weighting of mutual information and multi-dimensional amino acid rep
Background: Some amino acid residues functionally interact with each other. This interaction will result in an evolutionary co-variation between these residues – coevolution. Ou...
Rodrigo Gouveia-Oliveira, Anders Gorm Pedersen
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
13 years 12 months ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
CVPR
2010
IEEE
14 years 3 months ago
Automatic Discovery of Meaningful Object Parts with Latent CRFs
Object recognition is challenging due to high intra-class variability caused, e.g., by articulation, viewpoint changes, and partial occlusion. Successful methods need to strike a...
Paul Schnitzspan, Stefan Roth, Bernt Schiele
DAC
2009
ACM
14 years 8 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke