2728 search results - page 53 / 546 » Ideologies and Their Points of View |
UC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— In the current Internet, many applications start sessions with multiple connections to multiple servers in order to expedite the reception of data. One may argue that such aggr...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
123
click to vote
SGP
2004
15 years 2 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
112
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...