3958 search results - page 495 / 792 » Dynamic Graph Algorithms with Applications |
158
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
212
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
202
click to vote
MOBICOM
2003
ACM
15 years 12 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
183
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
189
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...