2373 search results - page 155 / 475 » Complexities for generalized models of self-assembly |
185
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Traditional security policies largely focus on access control requirements, which specify who can access what under what circumstances. Besides access control requirements, the av...
169
click to vote
EMSOFT
2004
Springer
15 years 10 months ago
2004
Springer
Separating the description of important aspects of a design such as behavior and architecture, or computation and communication, may yield significant advantages in design time as...
156
click to vote
ICAI
2003
15 years 7 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
197
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
186
click to vote
DAC
2004
ACM
15 years 12 months ago
2004
ACM
System-on-Chip (SoC) designs are increasingly becoming more complex. Efficient on-chip communication architectures are critical for achieving desired performance in these systems....