Sciweavers

11051 search results - page 84 / 2211
» An Investigation of Generalized Cases
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 3 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ECML
2003
Springer
14 years 3 months ago
A Two-Level Learning Method for Generalized Multi-instance Problems
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
Nils Weidmann, Eibe Frank, Bernhard Pfahringer
ACL
2004
13 years 11 months ago
Generalized Multitext Grammars
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
I. Dan Melamed, Giorgio Satta, Benjamin Wellington
DICTA
2003
13 years 11 months ago
Diamond, Hexagon, and General Polygonal Shaped Window Smoothing
Abstract. This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The al...
Changming Sun
DISOPT
2010
132views more  DISOPT 2010»
13 years 10 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...