Sciweavers

2969 search results - page 540 / 594
» A space efficient algorithm for group structure computation
Sort
View
TIP
1998
240views more  TIP 1998»
15 years 4 months ago
DCT-based motion estimation
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
Ut-Va Koc, K. J. Ray Liu
ISBI
2004
IEEE
16 years 5 months ago
Vascular Segmentation in Three-Dimensional Rotational Angiography Based on Maximum Intensity Projections
Three-dimensional rotational angiography (3D-RA) is a relatively new and promising technique for imaging blood vessels. In this paper, we propose a novel 3D-RA vascular segmentati...
Rui Gan, Albert C. S. Chung, Wilbur C. K. Wong, Si...
MP
2008
135views more  MP 2008»
15 years 5 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
UAI
2008
15 years 6 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey
163
Voted
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 5 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel