Sciweavers

6365 search results - page 53 / 1273
» Fast Local Computation Algorithms
Sort
View
CCCG
2007
15 years 2 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
83
Voted
WADS
1995
Springer
82views Algorithms» more  WADS 1995»
15 years 4 months ago
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
Dimitrios Kagaris, Spyros Tragoudas, Grammati E. P...
89
Voted
EVOW
2006
Springer
15 years 4 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
76
Voted
IMR
2007
Springer
15 years 6 months ago
SVR: Practical Engineering of a Fast 3D Meshing Algorithm*
Umut A. Acar, Benoît Hudson, Gary L. Miller,...
95
Voted
NDSS
2005
IEEE
15 years 6 months ago
New Streaming Algorithms for Fast Detection of Superspreaders
Shobha Venkataraman, Dawn Xiaodong Song, Phillip B...