1984 search results - page 219 / 397 » The colourful feasibility problem |
198
click to vote
FOCS
2008
IEEE
16 years 28 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
148
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
187
click to vote
IJRR
2008
15 years 6 months ago
2008
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
204
click to vote
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
Search is not inherent in the correspondence problem. We propose a representation of images, called intrinsic curves, that combines the ideas of associative storage of images with...
166
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...