Sciweavers

270 search results - page 52 / 54
» A robust model for finding optimal evolutionary trees
Sort
View
ICIP
2005
IEEE
15 years 11 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
ICML
2010
IEEE
14 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
PAMI
2010
241views more  PAMI 2010»
14 years 4 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
VLDB
2002
ACM
143views Database» more  VLDB 2002»
14 years 9 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït