2283 search results - page 186 / 457 » Bounds of Graph Characteristics |
185
Voted
CSR
2011
Springer
14 years 7 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
207
Voted
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
119
Voted
AAAI
2004
15 years 4 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
133
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
126
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...