Sciweavers

488 search results - page 85 / 98
» Automorphic Decompositions of Graphs
Sort
View
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 1 months ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
IPPS
1996
IEEE
13 years 12 months ago
A New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
Shousheng He, Mats Torkelson
AAAI
2006
13 years 9 months ago
CUI Networks: A Graphical Representation for Conditional Utility Independence
We introduce CUI networks, a compact graphical representation of utility functions over multiple attributes. CUI networks model multiattribute utility functions using the well stu...
Yagil Engel, Michael P. Wellman
GVD
2001
142views Database» more  GVD 2001»
13 years 9 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
Christian Süß
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 7 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon