Sciweavers

507 search results - page 46 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
ICC
2007
IEEE
14 years 2 months ago
PERD: Polynomial-based Event Region Detection in Wireless Sensor Networks
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 ...
Torsha Banerjee, Demin Wang, Bin Xie, Dharma P. Ag...
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
CVPR
2007
IEEE
14 years 9 months ago
Nonnegative Tucker Decomposition
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
Yong-Deok Kim, Seungjin Choi
ECCV
2006
Springer
14 years 9 months ago
A Simple Solution to the Six-Point Two-View Focal-Length Problem
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...
Hongdong Li
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong