1139 search results - page 184 / 228 » Bounded Ideation Theory |
TIT
1998
13 years 7 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
SP
2002
IEEE
13 years 7 months ago
2002
IEEE
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
ISVD
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less tha...
JMLR
2010
13 years 6 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
RSA
2010
13 years 6 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...