3466 search results - page 48 / 694 » Fast computation of special resultants |
KDD
2005
ACM
14 years 11 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...
SIGMOD
1997
ACM
14 years 3 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...
ICIP
2010
IEEE
13 years 9 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...
WONS
2005
IEEE
14 years 4 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 ...
EXPCS
2007
14 years 2 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...