663 search results - page 80 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
TSP
2010
13 years 2 months ago
2010
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
NIPS
2003
13 years 9 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
ETS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we address the test scheduling problem for Builtin Self-tested (BISTed) embedded SRAMs (e-SRAMs) when Data Retention Faults (DRFs) are considered. The proposed test ...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...