2403 search results - page 257 / 481 » Using the WinWin Spiral Model: A Case Study |
170
click to vote
SRDS
1998
IEEE
15 years 10 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...
190
click to vote
ZUM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
181
click to vote
NIPS
2008
15 years 8 months ago
2008
We study the problem of domain transfer for a supervised classification task in mRNA splicing. We consider a number of recent domain transfer methods from machine learning, includ...
153
click to vote
IADIS
2003
15 years 8 months ago
2003
In [7], we reported on our experience in building Collaborative Mobile Virtual Communities (CMVC) on the Web. In [8], we proposed a finite state machine model and a new approach t...
164
click to vote
BMVC
1998
15 years 8 months ago
1998
This paper tackles the problem of obtaining a good initial set of corner matches between two images without resorting to any constraints from motion or structure models. Several d...