3466 search results - page 48 / 694 » Fast computation of special resultants |
175
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
165
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
181
click to vote
ICIP
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper proposes a computationally efficient approach for estimating camera motion based on a voting mechanism that neither relies on explicit feature matching nor RANSAC. In t...
160
click to vote
WONS
2005
IEEE
15 years 11 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
161
click to vote
EXPCS
2007
15 years 9 months ago
2007
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...