Sciweavers

8728 search results - page 420 / 1746
» On Reduct Construction Algorithms
Sort
View
217
Voted
TAMC
2007
Springer
16 years 1 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
195
Voted
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
15 years 12 months ago
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
Stefan Kratsch, Pascal Schweitzer
VLDB
1998
ACM
77views Database» more  VLDB 1998»
15 years 11 months ago
Safely and Efficiently Updating References During On-line Reorganization
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-Iine reorganization a...
Chendong Zou, Betty Salzberg
187
Voted
RTSS
1996
IEEE
15 years 11 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
ADCS
2004
15 years 8 months ago
Phrases and Feature Selection in E-Mail Classification
In this paper we study the effectiveness of using a phrase-based representation in e-mail classification, and the affect this approach has on a number of machine learning algorithm...
Elisabeth Crawford, Irena Koprinska, Jon Patrick