4744 search results - page 128 / 949 » Connected Computing |
115
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
104
click to vote
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
—This paper describes a low cost, low power, versatile computation module that can be used as a coarse-grain building block in multimedia processors. The module, which has a data...
112
click to vote
CIE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
105
click to vote
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
121
Voted
CCGRID
2001
IEEE
15 years 6 months ago
2001
IEEE
As computing devices become ubiquitous and increasingly mobile, it is becoming apparent that the directed peerto-peer communication model has shortcomings for many forms of distri...