Sciweavers

4103 search results - page 383 / 821
» Some results on the Collatz problem
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
SIAMJO
2011
15 years 1 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
FIRA
2010
Springer
156views Robotics» more  FIRA 2010»
15 years 1 months ago
Attracting Students to Engineering: Using Intuitive HRIs for Educational Purposes
Today, industrialized countries are facing a major problem, the lack of skilled engineers. Despite the increasing demand for engineers in the labor market, the number of students g...
Pedro Neto, Nuno Mendes, Nélio Mourato, J. ...
TSMC
2010
15 years 1 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICCV
2011
IEEE
14 years 7 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan