Sciweavers

6142 search results - page 1036 / 1229
» The Complexity of Partition Functions
Sort
View
TVLSI
2002
111views more  TVLSI 2002»
15 years 4 months ago
Circular BIST with state skipping
Circular built-in self-test (BIST) is a "test per clock" scheme that offers many advantages compared with conventional BIST approaches in terms of low area overhead, simp...
Nur A. Touba
OIR
2007
123views more  OIR 2007»
15 years 4 months ago
The IP's guide to the galaxy of portal planning: part III - administrative framework
Purpose – This article is the third in a four-part series that aims to illustrate the process involved in planning a portal and creating a portal definition document. Design/me...
Amy M. Finley, Rebecca H. Augustyniak
PAMI
2007
164views more  PAMI 2007»
15 years 4 months ago
Space-Time Completion of Video
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...
Yonatan Wexler, Eli Shechtman, Michal Irani
137
Voted
PR
2007
189views more  PR 2007»
15 years 4 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
PR
2007
293views more  PR 2007»
15 years 4 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang
« Prev « First page 1036 / 1229 Last » Next »