• No results found

Reducing graph size: the weeding parameter

Reducing graphs in graph cut segmentation

Reducing graphs in graph cut segmentation

... for reducing graphs. During the creation of the graph, before creating a new node, we test if the node is really useful to the max-flow compu- ...reduced graph are typically located in a narrow band ...

5

Reducing the maximum degree of a graph by deleting edges

Reducing the maximum degree of a graph by deleting edges

... . Moreover, equality holds if G e is a special k-star union. A set of pairwise disjoint edges of G is called a matching of G. The matching number of G is the size of a largest matching of G and is denoted by α  ...

14

Reducing the maximum degree of a graph by deleting vertices

Reducing the maximum degree of a graph by deleting vertices

... We are now ready to state our main results, given in the next section. In Section 3, we investigate λ(G) from a structural point of view, particularly observing how this parameter changes with the removal of ...

12

Reducing the Size of Rule Set in a Firewall

Reducing the Size of Rule Set in a Firewall

... and firewall environment. The usefulness of direction-based filtering in firewalls is shown in [21]. It shows that the discrepancy can make it very confusing for firewall managers to recognize the direction of a packet ...

6

Graph Connectivity Measures for Unsupervised Parameter Tuning of Graph Based Sense Induction Systems

Graph Connectivity Measures for Unsupervised Parameter Tuning of Graph Based Sense Induction Systems

... para- graph of bc is a list of nouns which are assumed to be contextually related to the target word tw ...collocational graph The tar- get of this stage is to determine the related nouns, which will form ...

9

Parameter estimation of Ornstein-Uhlenbeck process generating a stochastic graph

Parameter estimation of Ornstein-Uhlenbeck process generating a stochastic graph

... In [ CFS15 , FI13 ], authors present a model for inter-bank lending in which d bank reserves are modeled through real-valued random processes X i . Whenever bank i has more reserves than bank j, i lends money to j, thus ...

27

Fixed parameter tractability of multicut parameterized by the size of the cutset

Fixed parameter tractability of multicut parameterized by the size of the cutset

... A very different application of the technique is given by Lokshtanov and Marx [?] in the context of clustering problems. They study a family of clustering problems such as partitioning the vertices of an undirected ...

31

Estimating population size via line graph reconstruction

Estimating population size via line graph reconstruction

... a graph consisting of 50 genotypes, consisting of 38 edges where 5 edges have to be removed to transform the graph into a line ...the graph due to these par- tial ...alpha parameter ...

10

Reducing the maximum degree of a graph by deleting vertices: the extremal cases

Reducing the maximum degree of a graph by deleting vertices: the extremal cases

... We call a subset R of V (G) a ∆-reducing set of G if ∆(G − R) < ∆(G) or R = V (G) (note that V (G) is the smallest ∆-reducing set of G if and only if ∆(G) = 0). Note that R is a ∆-reducing set of ...

9

Moving Objects Tracking in Video by Graph Cuts and Parameter Motion Model

Moving Objects Tracking in Video by Graph Cuts and Parameter Motion Model

... The graph cuts approach is often used to solve a labeling ...of graph cuts labeling, we only used the rectangle which contains the object to treat instead of using the entire image, this method allows us to ...

8

Moving Objects Tracking in Video by Graph Cuts and Parameter Motion Model

Moving Objects Tracking in Video by Graph Cuts and Parameter Motion Model

... The graph cuts approach is often used to solve a labeling ...of graph cuts labeling, we only used the rectangle which contains the object to treat instead of using the entire image, this method allows us to ...

8

Chapter 1. Fixed-Parameter Algorithms for Graph-Modeled Data Clustering

Chapter 1. Fixed-Parameter Algorithms for Graph-Modeled Data Clustering

... cluster graph has a very special structure: If two vertices are connected by an edge, then their neighborhoods must be the ...input graph G that are connected by an edge and where one vertex, say u, has a ...

27

The expected size of the sphere-of-influence graph

The expected size of the sphere-of-influence graph

... dual graph has proven to b e useful in this context [4], it may b e unsatisfactory when some comp onents of the data are redundant, and the data lies on a manifold of smaller dimension in R ...

13

Reducing the size of your Exchange mailbox

Reducing the size of your Exchange mailbox

... Reducing the size of your Exchange mailbox There is a size limit set up on your mailbox, usually at 2GB. In most cases this is ample. However if your mailbox is getting full you will begin to receive ...

6

Reducing Size of Updates in Android Applications

Reducing Size of Updates in Android Applications

... Delta++: Reducing the Size of Android Application Updates Google developed Google Smart Application Update to reduce the size of the application ...the size of the android application update, ...

6

New Approach for Reducing the Size of Ciphertext

New Approach for Reducing the Size of Ciphertext

... 2 Professor, Department of Computer Science, Alagappa University Tamil Nadu, India ABSTRACT Cryptography is a mathematical logic used to generate secret code for a given confidential input text for maintaining one‘s own ...

5

Reducing the Size of the Representation for the uDOP Estimate

Reducing the Size of the Representation for the uDOP Estimate

... The results show that the minimization algo- rithm tends to cut the number of transitions in half for all corpora. This means these re- ductions in the number of transitions could be used to double the size of the ...

11

3 Reducing the Size of the System of Equations

3 Reducing the Size of the System of Equations

... maximum size of the system, which can be solved us- ing the MFA on a one ...memory size for solving the system with the assembled matrix is n Γ Ω × n Γ Ω ...memory size for interpolating the mesh ...

7

Fixed-Parameter Tractable Distances to Sparse Graph Classes

Fixed-Parameter Tractable Distances to Sparse Graph Classes

... Abstract We show that for various classes C of sparse graphs, and several measures of distance to such classes such as edit distance and elimination distance, the problem of determining [r] ...

20

21310754 an Indian Weeding

21310754 an Indian Weeding

... married males are better. She was serious, but said, if some problem. Opps I said my mistake. You can take a packet of pills from my purse (same as I had given to Chavi) it can be used any time even morning after, but ...

144

Show all 10000 documents...

Related subjects