Sciweavers

370 search results - page 27 / 74
» Independent Sets with Domination Constraints
Sort
View
ICCV
2007
IEEE
16 years 3 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
CASCON
2004
108views Education» more  CASCON 2004»
15 years 3 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
ICML
2008
IEEE
16 years 2 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
93
Voted
ICCAD
2008
IEEE
80views Hardware» more  ICCAD 2008»
15 years 10 months ago
Advancing supercomputer performance through interconnection topology synthesis
—In today’s many-core era, the interconnection networks have been the key factor that dominates the performance of a computer system. In this paper, we propose a design flow t...
Yi Zhu, Michael Taylor, Scott B. Baden, Chung-Kuan...
OPODIS
2007
15 years 3 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...