Sciweavers

1933 search results - page 195 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
124
Voted
DAC
1998
ACM
16 years 5 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
JCB
2008
96views more  JCB 2008»
15 years 4 months ago
Computing Knock-Out Strategies in Metabolic Networks
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
Utz-Uwe Haus, Steffen Klamt, Tamon Stephen
WEBI
2005
Springer
15 years 10 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
VLDB
2007
ACM
128views Database» more  VLDB 2007»
15 years 10 months ago
A genetic approach for random testing of database systems
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleks...
KDD
2012
ACM
226views Data Mining» more  KDD 2012»
13 years 6 months ago
TourViz: interactive visualization of connection pathways in large graphs
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Han...