Filters

30 Hits in 10.3 sec

### Page 5941 of Mathematical Reviews Vol. , Issue 89K [page]

1989 Mathematical Reviews
for graphs with no vertex degree exceeding three.  ...  The paper shows that both the nonseparating independent set problem (P,,;,) and the feedback set problem (P;,) can be solved in polynomial time for graphs with no vertex degree exceeding 3.  ...

### Maximum genus and maximum nonseparating independent set of a 3-regular graph

Yuangqiu Huang, Yanpei Liu
1997 Discrete Mathematics
A set J C V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E A {uv [ Vu, v E J} = 0, and G -J is connected.  ...  We call z(G) = maxJ{lJ[ tJ is an nsis of G} the nsis number of G. Let G be a 3-regular connected graph; we prove that the maximum genus, denoted by 7M(G), of G is equal to z(G).  ...  Acknowledgements The authors thank the referees for correcting a number of errors on the original version of the paper.  ...

### Author index

1988 Discrete Mathematics
Kajitani and S. Gotoh, On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three Ueno, S., see Y.  ...  ., An algorithm for solving the jump number problem Teh, H.H. Wierman, J.C., see K. Nowicki Yap, H.P., Packing of graphs-a survey Zhang, Fu-ji, X. Guo and R-s.  ...

### Page 5392 of Mathematical Reviews Vol. , Issue 89J [page]

1989 Mathematical Reviews
(pp. 347-353); Shuichi Ueno, Yoji Kajitani and Shin’ya Gotoh, On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (pp. 355-360); Kazuhiko  ...  A 50 (1989), no. 1, 162-163. For S CN the sumset P(S) is defined as the set of all sums a; + +++, t arbitrary, a; distinct elements of S. Let F(k) denote the  ...

### Master index of volumes 71–80

1990 Discrete Mathematics
Kajitani and S. Gotoh, On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three Ueno, S., see Kajitani, Y.  ...  Bollobas, B. and G. Brightwell, Long cycles in graphs with no subgraphs of minimal degree 3 Bollobas, B. and H.R. Hind, A new upper bound for the list chromatic number Bollobas, B. and S.  ...

### Semi-supervised learning for scalable and robust visual search

Jun Wang
2011 ACM SIGMultimedia Records
A common theme shared between these two subareas of our work is the focus on semi-supervised learning paradigm, in which a small set of labeled data is complemented with large unlabeled datasets.  ...  We derive a rigorous formulation in which a supervised term minimizes the empirical errors on the labeled data and an unsupervised term provides effective regularization by maximizing variance and independence  ...  Assume in the tth iteration the connectivity is C t = {c t jk } and an unlabeled vertex x i with degree d i is assigned to the labeled set S j .  ...

### Simplification and Compression of 3D Scenes [article]

Jarek Rossignac
1997 Eurographics State of the Art Reports
This situation is not likely to change, because the need for higher levels of accuracy in the 3D models and the complexity of the industrial and scientific 3D data sets increase at a much faster rate than  ...  The solution requires intelligent techniques that compress the 3D scenes for fast transmission over the network or phone line and that use auxiliary datastructures and adaptive resolution techniques to  ...  incidence information (between 2 and 4 bits per vertex, depending on the incidence graph).  ...

### CALCULUS OF FUZZY RESTRICTIONS [chapter]

1975 Fuzzy Sets and their Applications to Cognitive and Decision Processes
In terms of such restrictions, the meaning of a proposition of the form "x is P," where x is the name of an object and P is a fuzzy set, may be expressed as a relational assignment equation of the form  ...  The calculus of fuzzy restrictions is concerned, in the main, with (a) translation of propositions of various types into relational assignment equations, and (b) the study of transformations of fuzzy restrictions  ...  ACKNOWLEDGEMENTS The authors w ish to express their appreciation to Professor Y. Morita for his valuable discussion.  ...

### Vertex covers and connected vertex covers in 3-connected graphs

T. Watanabe, S. Kajita, K. Onaga
1991., IEEE International Sympoisum on Circuits and Systems
Time complexity analysis of these problems for 3-connected graphs are the main subject o f the p a p e r .  ...  A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively.  ...  Acknowledgements The research of T.Watanabe is partly supported by the Grant in Aid for Scientific Research of the Ministry of Education, Science and Culture of Japan  ...

### Abstracts of Working Papers in Economics

1992 Abstracts of Working Papers in Economics
For more recent as well as historical information, consult the AWPE DATABASE, available on magnetic media from Cambridge University Press. Abowd, John M.  ...  Brief entries appear for secondary authors, cross-referenced to the primary author.  ...  The model allows for the non-stationarity of the data, and for unobserved stochastic switches of regime, by estimating VAR's in the yield spread and the change in the three month rate which allow the time  ...

### Page 1128 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews
(Russian) 891:68063 Ueno, Shuichi (with Kajitani, Yoji; Gotoh, Shin'ya) On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. 89k:05085  ...  Efficient systolic algorithm for finding bridges in a connected graph. 89a:68111 Zverovich, 1. E. The degree set of a tree.  ...

### Constructive physics [article]

Yuri Ozhigov
2008 arXiv   pre-print
Discussion of the necessity to use the constructive mathematics as the formalism of quantum theory for systems with many particles.  ...  We can set the other problem: what is the comparative probability that some three fixed particles once appear at one line in comparison with the other three particles, provided the initial states of all  ...  Their visual representation makes no problem, for example, there are no difficulties with the change of the size with the distance like in perspective, etc. 2.  ...

### 25th Annual Computational Neuroscience Meeting: CNS-2016

Tatyana O. Sharpee, Alain Destexhe, Mitsuo Kawato, Vladislav Sekulić, Frances K. Skinner, Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári, Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett (+597 others)
2016 BMC Neuroscience
BMC Neuroscience 2016, 17(Suppl 1):A1 Neural circuits are notorious for the complexity of their organization.  ...  These results outline a framework for categorizing neuronal types based on their functional properties.  ...  The funders had no role in study design, data collection and analysis, the decision to publish, or the preparation of the manuscript.  ...

### Abstracts of Working Papers in Economics

1997 Abstracts of Working Papers in Economics
For more recent as well as historical information, consult the AWPE DATABASE, available on magnetic media from Cambridge University Press. (Call 212-924-3900) Abadir, Karim M. PD October 1995.  ...  This section contains abstracts and complete bibliographic information for current working papers, listed alphabetically by primary author.  ...  It is found that robustness depends on the contemporaneous covariance between the disturbances of the cointegrating regression and the shocks driving the regressors and on the extent of the deviation from  ...

### Abstracts of Working Papers in Economics

1987 Abstracts of Working Papers in Economics
The approach emphasizes the equilibrium value set and the static optimization problems embedded in extremal equilibria.  ...  Security price data for the firms were merged with these bargaining unit level settlement data.  ...  AB We introduce a new graph theoretic parameter called order-degree sequence and study its impact on connectivity, edge connectivity, vertex and edge coverings and independence numbers.  ...
« Previous Showing results 1 — 15 out of 30 results