Sciweavers

94 search results - page 9 / 19
» The Generic Graph Component Library
Sort
View
IWPEC
2009
Springer
14 years 4 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
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...
Peter Damaschke
TCS
2008
13 years 9 months ago
Competitive graph searches
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...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
COMPSAC
2002
IEEE
14 years 2 months ago
XVIP: An XML-Based Video Information Processing System
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...
Edith C. H. Ngai, Pat Pik-Wah Chan, Edward Yau, Mi...
SIGSOFT
2005
ACM
14 years 3 months ago
Reuse and variability in large software applications
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...
Jacky Estublier, Germán Vega
SEKE
2001
Springer
14 years 2 months ago
Gadget: A Tool for Extracting the Dynamic Structure of Java Programs
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...
Juan Gargiulo, Spiros Mancoridis