Sciweavers

1027 search results - page 47 / 206
» Ordered Vertex Partitioning
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
14 years 2 months ago
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Teru...
EPEW
2005
Springer
14 years 3 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 2 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
ISPA
2004
Springer
14 years 3 months ago
Towards Correct Distributed Simulation of High-Level Petri Nets with Fine-Grained Partitioning
Abstract. Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the l...
Michael Knoke, Felix Kühling, Armin Zimmerman...