1291 search results - page 152 / 259 » Computing the multiplicity structure in solving polynomial s... |
CONEXT
2008
ACM
15 years 3 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
136
click to vote
LION
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
135
click to vote
ECAL
2007
Springer
15 years 7 months ago
2007
Springer
Language can be viewed as a complex adaptive system which is continuously shaped and reshaped by the actions of its users as they try to solve communicative problems. To maintain c...
106
click to vote
CVPR
1999
IEEE
16 years 3 months ago
1999
IEEE
This paper presents a new approach to computing dense depth and motion estimates from multiple images. Rather than computing a single depth or motion map from such a collection, w...
130
click to vote
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...