1086 search results - page 88 / 218 » Jug measuring: Algorithms and complexity |
101
click to vote
SIGMOD
2011
ACM
14 years 18 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
109
click to vote
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
A new approach to align an image of a textured object with a given prototype is proposed. Visual appearance of the images, after equalizing their signals, is modeled with a Markov...
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper the Self-Localization problem for Sensor Networks is addressed. Given a set of nodes deployed in an environment, self-localization consists of finding out the loc...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...