Sciweavers

1170 search results - page 111 / 234
» How Fast Is Too Fast
Sort
View
TON
2010
279views more  TON 2010»
15 years 1 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh
EACL
2009
ACL Anthology
15 years 1 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
123
Voted
ICCV
2001
IEEE
16 years 5 months ago
Very High Accuracy Velocity Estimation using Orientation Tensors Parametric Motion and Simultaneous Segmentation of the Motion F
In [10] we presented a new velocity estimation algorithm, using orientation tensors and parametric motion models to provide both fast and accurate results. One of the tradeoffs be...
Gunnar Farnebäck
ICIP
2006
IEEE
16 years 4 months ago
Orientation Interpolation and Applications
Psychovision have shown that many grouping laws come into play to structure human vision. They use informations of different kinds, not only gray (or color)-level values. Here we ...
Anatole Chessel, Ronan Fablet, Frédé...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 3 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore