Sciweavers

116 search results - page 10 / 24
» Implicit B-Trees: New Results for the Dictionary Problem
Sort
View
DSD
2010
IEEE
171views Hardware» more  DSD 2010»
14 years 11 months ago
Test Patterns Compression Technique Based on a Dedicated SAT-Based ATPG
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
Jiri Balcarek, Petr Fiser, Jan Schmidt
102
Voted
ICALP
2005
Springer
15 years 5 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ICA
2007
Springer
15 years 6 months ago
Morphological Diversity and Sparsity in Blind Source Separation
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on mo...
Jérôme Bobin, Yassir Moudden, Jalal F...
107
Voted
SIGGRAPH
1998
ACM
15 years 4 months ago
Wires: A Geometric Deformation Technique
Finding effective interactive deformation techniques for complex geometric objects continues to be a challenging problem in modeling and animation. We present an approach that is ...
Karan Singh, Eugene Fiume
80
Voted
AAAI
2007
15 years 2 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...