Sciweavers

1933 search results - page 16 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
DCFS
2011
66views more  DCFS 2011»
12 years 7 months ago
Kleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade
SIGIR
2011
ACM
12 years 10 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
JAIR
2006
92views more  JAIR 2006»
13 years 7 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
IV
1999
IEEE
91views Visualization» more  IV 1999»
13 years 11 months ago
Triangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...
Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho