Sciweavers

1802 search results - page 182 / 361
» Sparse Computations with PEI
Sort
View

Publication
210views
15 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
SC
2009
ACM
15 years 11 months ago
Allocator implementations for network-on-chip routers
The present contribution explores the design space for virtual channel (VC) and switch allocators in network-on-chip (NoC) routers. Based on detailed RTL-level implementations, we...
Daniel U. Becker, William J. Dally
FOCS
2009
IEEE
15 years 11 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
161
Voted
ICALP
2007
Springer
15 years 10 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
15 years 10 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao