Sciweavers

1026 search results - page 93 / 206
» On Finding Minimal w-cutset
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 6 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 6 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
IJCM
2002
92views more  IJCM 2002»
15 years 6 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
PR
2002
202views more  PR 2002»
15 years 6 months ago
Illumination color covariant locale-based visual object retrieval
Search by Object Model -- finding an object inside a target image -- is a desirable and yet difficult mechanism for querying multimedia data. An added difficulty is that objects c...
Mark S. Drew, Ze-Nian Li, Zinovi Tauber
SIAMJO
2002
117views more  SIAMJO 2002»
15 years 6 months ago
Analysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. ...
Charles Audet, J. E. Dennis Jr.