942 search results - page 137 / 189 » Constraints in Graph Drawing Algorithms |
130
Voted
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
136
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
125
Voted
AAMAS
2002
Springer
15 years 2 months ago
2002
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...
109
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
136
Voted
COMPLEX
2009
Springer
15 years 6 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...