1728 search results - page 206 / 346 » The Accelerated Euclidean Algorithm |
135
click to vote
KDD
1997
ACM
15 years 7 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
131
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
100
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
146
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
124
click to vote
JCO
2006
15 years 3 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...