415 search results - page 25 / 83 » time 1994 |
SODA
1994
ACM
13 years 12 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
BILDMED
2003
14 years 19 hour ago
2003
We present an approach to generating volumetric meshes from closed triangulated surface meshes. The approach initially generates a structured hexahedral mesh based on the bounding ...
SIAMCOMP
1998
13 years 10 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
ICALP
1994
Springer
14 years 2 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
POS
1994
Springer
14 years 2 months ago
1994
Springer
With the emerging of 10 Gbps Ethernet, modern storage networks allow the hosts to access remote cache nearly as quickly as they can access from their local storages. Aiming at imp...