Sciweavers

1088 search results - page 19 / 218
» Independence of Negative Constraints
Sort
View
MP
2007
89views more  MP 2007»
13 years 7 months ago
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
Arkadi Nemirovski
JCT
2011
101views more  JCT 2011»
13 years 2 months ago
Almost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
József Balogh, Dhruv Mubayi
CVPR
2004
IEEE
14 years 9 months ago
Reconstructing 3D Independent Motions Using Non-Accidentalness
Reconstructing 3D scenes with independently moving objects from uncalibrated monocular image sequences still poses serious challenges. One important problem is to find the relativ...
Kemal Egemen Ozden, Kurt Cornelis, Luc Van Eycken,...
ICC
2007
IEEE
170views Communications» more  ICC 2007»
14 years 1 months ago
Evaluating Techniques for Network Layer Independence in Cognitive Networks
— Cognitive networks are the latest progression of cognitive functionality into the networking stack, an effort which began with a layer one and two focus on cognitive radios, an...
Muthukumaran Pitchaimani, Benjamin J. Ewy, Joseph ...
AGP
1995
IEEE
13 years 11 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella