Sciweavers

814 search results - page 67 / 163
» Optimal pairings
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
EPEW
2006
Springer
14 years 1 months ago
Experimental Analysis of the Correlation of HTTP GET Invocations
In this paper we experimentally investigate if optimal retry times can be determined based on models that assume independence of successive tries. We do this using data obtained fo...
Philipp Reinecke, Aad P. A. van Moorsel, Katinka W...
AIPS
2007
14 years 9 days ago
Managing Personal Tasks with Time Constraints and Preferences
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
Ioannis Refanidis
CGF
2008
148views more  CGF 2008»
13 years 10 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 10 months ago
Cooperative Secret Communication with Artificial Noise in Symmetric Interference Channel
We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful...
Jingge Zhu, Jianhua Mo, Meixia Tao