Sciweavers

2681 search results - page 151 / 537
» Problem F
Sort
View
MP
2002
105views more  MP 2002»
13 years 10 months ago
Local behavior of an iterative framework for generalized equations with nonisolated solutions
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 F(z) + T (z), where T is a multifu...
Andreas Fischer
JUCS
2010
130views more  JUCS 2010»
13 years 8 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
COMPGEOM
2006
ACM
14 years 4 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
IJCAI
1989
13 years 11 months ago
And-Or Graphs Applied to RUE Resolution
In equality-based binary r e s o l u t i o n , the v i a b i l i t y t e s t is used as a decision mechanism to select disagreement sets and also to define the RUE u n i f i e r ....
Vincent J. Digricoli, James J. Lu, V. S. Subrahman...
BMCBI
2006
141views more  BMCBI 2006»
13 years 10 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