10988 search results - page 218 / 2198 » Algorithmic Folding Complexity |
125
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
140
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
146
Voted
ISCC
2006
IEEE
15 years 9 months ago
2006
IEEE
— One of the benefits of web services is their ability to participate in a web services composition process. Therefore, an end-to-end QoS infrastructure should be established. W...
150
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
139
Voted
DAC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...