432 search results - page 77 / 87 » Internally deterministic parallel algorithms can be fast |
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
110
click to vote
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
126
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
GPC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Sensor network deployment and its maintenance are very challenging due to hostile and unpredictable nature of environments. The field coverage of a wireless sensor networ...
GRAPHITE
2006
ACM
15 years 3 months ago
2006
ACM
Implicit surface is a well-known surface representation. Geometric details of an object can be represented using less surface primitives than other representations such as polygon...