185 search results - page 37 / 37 » its 1992 |
104
click to vote
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
IIE
2007
14 years 9 months ago
2007
Conventional wisdom attributes the lack of effective technology use in classrooms to a shortage of professional development or poorly run professional development. At the same time...
NN
1998
Springer
14 years 9 months ago
1998
Springer
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
MUC
1992
15 years 1 months ago
1992
The GE NLTooLsET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUG-4 task . INTR...
SODA
1992
ACM
14 years 10 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...