94 search results - page 9 / 19 » The Generic Graph Component Library |
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
TCS
2008
14 years 10 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
COMPSAC
2002
IEEE
15 years 3 months ago
2002
IEEE
We describe XVIP, an XML-based video information processing system, which extracts information from video and stores the information in a multimedia digital video library. XVIP en...
84
Voted
SIGSOFT
2005
ACM
15 years 4 months ago
2005
ACM
Reuse has always been a major goal in software engineering, since it promises large gains in productivity, quality and time to market reduction. Practical experience has shown tha...
103
click to vote
SEKE
2001
Springer
15 years 3 months ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...