Sciweavers

260 search results - page 24 / 52
» Hardness of Parameterized Resolution
Sort
View
GPCE
2008
Springer
13 years 8 months ago
Lightweight dependent classes
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
Tetsuo Kamina, Tetsuo Tamai
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
TCS
1998
13 years 7 months ago
Threshold Dominating Sets and an Improved Characterization of W[2]
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
Rodney G. Downey, Michael R. Fellows
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 5 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICPR
2006
IEEE
14 years 8 months ago
Camera Text Recognition based on Perspective Invariants
As camera resolution increases, high-speed non-contact text capture through a digital camera is opening up a new channel for document capture and understanding. Unfortunately, per...
Chew Lim Tan, Shijian Lu