4744 search results - page 85 / 949 » Connected Computing |
127
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
128
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
This paper extends prior work using Compositional Pattern Producing Networks (CPPNs) as a generative encoding for the purpose of simultaneously evolving robot morphology and contr...
138
click to vote
CATA
2000
15 years 3 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
110
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
152
click to vote
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...