1368 search results - page 47 / 274 » UXnet: making connections |
158
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
124
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
A Beowulf cluster is a MIMD multiprocessor built from commodity off-the-shelf personal computers connected via a dedicated network, running free open-source software. Such a clust...
166
click to vote
SIGMOD
2008
ACM
15 years 5 months ago
2008
ACM
This paper is talks about the critical role that Jim Gray played in the creation of the WorldWide Telescope software. Contrary to what you might think it wasn't his database ...
174
click to vote
ISCAS
1993
IEEE
15 years 10 months ago
1993
IEEE
: In this study, we propose two types of coupled oscillators networks and investigate their steady states. One network has two-dimensional honeycomb structure. The other network ha...
161
click to vote
TFS
2008
15 years 6 months ago
2008
Abstract-- Our starting point is the multiplicative utility function which is extensively used in the theory of multicriteria decision making. Its associativity is shown and as its...