13917 search results - page 2642 / 2784 » Abstraction of Probabilistic Systems |
230
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
185
click to vote
PPOPP
1997
ACM
15 years 11 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
154
Voted
CHI
1996
ACM
15 years 11 months ago
1996
ACM
The design of CSCW systems has often had its roots in ethnomethodological understandings of work and investigations of working settings. Increasingly, we are also seeing these ide...
180
click to vote
PLILP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...
177
click to vote
IWSSD
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper, we propose the use of fine-grain process modelling as an aid to software development. We suggest the use of two levels of granularity, one at the level of the indiv...