1857 search results - page 117 / 372 » Minimum Degree Orderings |
167
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
170
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
169
click to vote
JSYML
2007
15 years 6 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
174
click to vote
MOC
2002
15 years 6 months ago
2002
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space ...
160
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Currently, hardware intellectual property (IP) is delivered at vels of abstraction: hard, firm, and soft. In order to further enhance performance, efficiency, and flexibility of I...