1265 search results - page 102 / 253 » Algorithms for Drawing Media |
157
click to vote
ECRTS
2009
IEEE
15 years 1 months ago
2009
IEEE
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
149
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper proposes a TCP compatible greediness control mechanism that tunes the greediness of the multimedia streaming process based on client priority, in order to make more ...
142
click to vote
VLSID
2006
IEEE
15 years 9 months ago
2006
IEEE
Low density parity check (LDPC) codes are one of the most powerful error correcting codes known. Recent research have pointed out their potential for a low cost, low latency hardw...
107
click to vote
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
A novel algorithm for robust RANSAC-like estimation of epipolar geometry (of uncalibrated camera pair) from two correspondences of local affine frames (LAFs) is presented. Each LA...
155
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...