Sciweavers

352 search results - page 54 / 71
» Experimental Analysis of Approximation Algorithms for the Ve...
Sort
View
TCS
2010
13 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
FGR
2004
IEEE
132views Biometrics» more  FGR 2004»
13 years 11 months ago
Expand Training Set for Face Detection by GA Re-sampling
Data collection for both training and testing a classifier is a tedious but essential step towards face detection and recognition. All of the statistical methods suffer from this ...
Jie Chen, Xilin Chen, Wen Gao
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
IVC
2000
179views more  IVC 2000»
13 years 7 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...