13621 search results - page 353 / 2725 » Computability and Complexity in Self-assembly |
208
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
161
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
183
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
187
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
195
click to vote
RTAS
2009
IEEE
16 years 1 months ago
2009
IEEE
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...