Sciweavers

1857 search results - page 252 / 372
» Minimum Degree Orderings
Sort
View
TC
1998
15 years 6 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç
TIP
2002
109views more  TIP 2002»
15 years 6 months ago
Adaptive rood pattern search for fast block-matching motion estimation
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Yao Nie, Kai-Kuang Ma
VLSISP
2002
103views more  VLSISP 2002»
15 years 6 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
PAMI
2007
220views more  PAMI 2007»
15 years 6 months ago
Automatic Age Estimation Based on Facial Aging Patterns
While recognition of most facial variations, such as identity, expression and gender, has been extensively studied, automatic age estimation has rarely been explored. In contrast ...
Xin Geng, Zhi-Hua Zhou, Kate Smith-Miles
RSA
2008
103views more  RSA 2008»
15 years 6 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav