Sciweavers

4926 search results - page 613 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ASPDAC
2010
ACM
155views Hardware» more  ASPDAC 2010»
15 years 16 days ago
Efficient model reduction of interconnects via double gramians approximation
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Yic...
119
Voted
PODC
2003
ACM
15 years 7 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
ACCV
1998
Springer
15 years 6 months ago
Digital Geometric Methods in Image Analysis and Compression
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
Ari D. Gross, Longin Jan Latecki
124
Voted
ICCV
2009
IEEE
16 years 7 months ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
133
Voted
COCOON
2003
Springer
15 years 7 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...