432 search results - page 16 / 87 » Minimum Weight Pseudo-Triangulations |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
EMNLP
2008
14 years 12 months ago
2008
Minimum Error Rate Training (MERT) is an effective means to estimate the feature function weights of a linear model such that an automated evaluation criterion for measuring syste...
SRDS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
ESA
2000
Springer
15 years 2 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
This paper presents a robust unsupervised learning approach for detection of anomalies in patterns of human behavior using multi-modal smart environment sensor data. We model the ...