Sciweavers

620 search results - page 52 / 124
» The edge-flipping group of a graph
Sort
View
ICSM
2009
IEEE
14 years 3 months ago
A combinatorial approach to building navigation graphs for dynamic web applications
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
Wenhua Wang, Yu Lei, Sreedevi Sampath, Raghu Kacke...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
ISMB
2003
13 years 10 months ago
Deriving phylogenetic trees from the similarity analysis of metabolic pathways
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
Maureen Heymans, Ambuj K. Singh
GRID
2008
Springer
13 years 9 months ago
ADL: An Algorithm Definition Language for SmartGridSolve
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
Michele Guidolin, Alexey L. Lastovetsky
IJCAI
2007
13 years 10 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan