607 search results - page 31 / 122 » Unifying Exact Completions |
EUROGRAPHICS
2010
Eurographics
15 years 1 days ago
2010
Eurographics
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
ACL
2009
14 years 8 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
98
Voted
LORI
2009
Springer
15 years 5 months ago
2009
Springer
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
121
click to vote
CAV
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. In this paper, we describe the features of the Timed Abstract State Machine toolset. The toolset implements the features of the Timed Abstract State Machine (TASM) langua...
PAKM
2008
15 years 10 days ago
2008
Abstract. We propose a unified and complete solution for expert finding in organizations, including not only expertise identification, but also expertise selection functionality. T...