2168 search results - page 89 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
125
Voted
ISPD
1998
ACM
15 years 8 months ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
146
Voted
UAI
2004
15 years 5 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
162
Voted
DBSEC
2009
15 years 4 months ago
2009
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...
161
Voted
SIGGRAPH
1996
ACM
15 years 7 months ago
1996
ACM
Sketching communicates ideas rapidly through approximate visual images with low overhead (pencil and paper), no need for precision or specialized knowledge, and ease of low-level ...
145
Voted
SCALESPACE
2005
Springer
15 years 9 months ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...