1888 search results - page 245 / 378 » Proof theory and computational analysis |
96
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
126
Voted
BIRTHDAY
2007
Springer
15 years 5 months ago
2007
Springer
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of c...
121
Voted
RT
1995
Springer
15 years 5 months ago
1995
Springer
Reconstruction is imperative whenever an image or a volume needs to be resampled as a result of an affine or perspective transformation, texture mapping, or volume rendering. We p...
131
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
ACL
2010
14 years 12 months ago
2010
The emergence of social media brings chances, but also challenges, to linguistic analysis. In this paper we investigate a novel problem of discovering patterns based on emotion an...