2124 search results - page 112 / 425 » Aggregating time partitions |
167
click to vote
PAMI
2006
15 years 5 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
152
click to vote
CGF
1999
15 years 5 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
173
click to vote
CSR
2009
Springer
16 years 17 days ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
179
click to vote
PIMRC
2008
IEEE
16 years 11 days ago
2008
IEEE
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
151
click to vote
ICPADS
2005
IEEE
15 years 11 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...