5889 search results - page 939 / 1178 » Graph Layout Problems |
156
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
192
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
205
click to vote
OPODIS
2004
15 years 8 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
279
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
158
Voted
EOR
2008
15 years 6 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...