Sciweavers

495 search results - page 47 / 99
» Data exchange: computing cores in polynomial time
Sort
View
ICCV
2003
IEEE
14 years 11 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
EUROPAR
2010
Springer
13 years 9 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
INFOCOM
2005
IEEE
14 years 2 months ago
CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming
— This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availabi...
Xinyan Zhang, Jiangchuan Liu, Bo Li, Tak-Shing Pet...
POPL
2003
ACM
14 years 9 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
INFORMS
2010
100views more  INFORMS 2010»
13 years 6 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...