6833 search results - page 38 / 1367 » Some two-character sets |
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
108
click to vote
CVBIA
2005
Springer
15 years 5 months ago
2005
Springer
We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automat...
IPL
2008
14 years 11 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
106
click to vote
RSEISP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Rough sets have been applied to many areas where multiattribute data is needed to be analyzed to acquire knowledge for decision making. Web-based Support Systems (WSS) ar...