4539 search results - page 153 / 908 » Approaches to Compute Workflow Complexity |
139
click to vote
RSS
2007
15 years 5 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
108
Voted
PERCOM
2009
ACM
15 years 10 months ago
2009
ACM
— The increasing availability of sensing devices has made the possibility of context-aware pervasive computing applications real. However, constructing this software requires ext...
132
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
141
click to vote
ICAIL
2005
ACM
15 years 9 months ago
2005
ACM
Computational law is an approach to automated legal reasoning focusing on semantically rich laws, regulations, contract terms, and business rules in the context of electronicallym...
140
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...