2969 search results - page 272 / 594 » A space efficient algorithm for group structure computation |
122
click to vote
JCDCG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
133
click to vote
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
137
click to vote
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
150
click to vote
ACSC
2004
IEEE
15 years 8 months ago
2004
IEEE
When modern processors keep increasing the instruction window size and the issue width to exploit more instruction-level parallelism (ILP), the demand of larger physical register ...
149
click to vote
ISVC
2005
Springer
15 years 10 months ago
2005
Springer
The extraction of consistent skeletons in the presence of boundary noise is still a problem for most skeletonization algorithms. Many suppress skeletons associated with boundary pe...