Sciweavers

DAC
1998
ACM
13 years 7 months ago
Compatible Class Encoding in Hyper-Function Decomposition for FPGA Synthesis
Recently, functional decomposition has been adopted for LUT based FPGA technology mapping with good results. In this paper, we propose a novel method for functional multipleoutput...
Jie-Hong Roland Jiang, Jing-Yang Jou, Juinn-Dar Hu...
RT
1999
Springer
13 years 8 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
COMPGEOM
2003
ACM
13 years 9 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
PG
2003
IEEE
13 years 9 months ago
Interactive Simulation of Burning Objects
In this paper we describe a fast and interactive method for simulating and controlling the combustion process together with the decomposition of burning solids. The combustion and...
Zeki Melek, John Keyser
IMR
2004
Springer
13 years 9 months ago
Mark-It: A Marking User Interface for Cutting Decomposition Time
We present Mark-It, a marking user interface that reduced the time to decompose a set of CAD models exhibiting a range of decomposition problems by as much as fifty percent. Inst...
Nicholas C. Yang, Andrew S. Forsberg, Jason F. She...
CSCLP
2004
Springer
13 years 9 months ago
New Structural Decomposition Techniques for Constraint Satisfaction Problems
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
Yaling Zheng, Berthe Y. Choueiry
FOSSACS
2005
Springer
13 years 9 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
13 years 9 months ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
ICA
2007
Springer
13 years 9 months ago
Two Improved Sparse Decomposition Methods for Blind Source Separation
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
PIMRC
2008
IEEE
13 years 10 months ago
Limited feedback for multi-antenna multi-user communications with Generalized Multi-Unitary Decomposition
– In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transfor...
Wee Seng Chua, Chau Yuen, Yong Liang Guan, Francoi...