5100 search results - page 778 / 1020 » The Linear Complexity of a Graph |
175
click to vote
APLAS
2005
ACM
16 years 1 days ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
199
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
146
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
172
click to vote
SIGGRAPH
1998
ACM
15 years 10 months ago
1998
ACM
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
177
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...