925 search results - page 50 / 185 » Connectivity on Complete Lattices |
CCCG
2003
15 years 1 months ago
2003
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R3 . We show that n 3 line segments in R3 admit 0,...
DBPL
1999
Springer
15 years 4 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
AIRWEB
2009
Springer
15 years 6 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
108
click to vote
GMP
2008
IEEE
15 years 6 months ago
2008
IEEE
Surface parameterization is a fundamental tool in geometric modeling and processing. Most existing methods deal with simply connected disks. This work introduces a novel method to ...