507 search results - page 46 / 102 » Computing Sparse Multiples of Polynomials |
136
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
122
click to vote
TCS
2008
15 years 2 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
128
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
88
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
116
Voted
NIPS
2007
15 years 3 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...