Sciweavers

1950 search results - page 74 / 390
» Varieties of Increasing Trees
Sort
View
ICPP
1995
IEEE
14 years 1 months ago
Impact of Load Imbalance on the Design of Software Barriers
Software barriers have been designed and evaluated for barrier synchronization in large-scale shared-memory multiprocessors, under the assumption that all processorsreach the sync...
Alexandre E. Eichenberger, Santosh G. Abraham
FUIN
2006
81views more  FUIN 2006»
13 years 10 months ago
Indexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
Vladimir Pestov, Aleksandar Stojmirovic
MIR
2010
ACM
179views Multimedia» more  MIR 2010»
13 years 8 months ago
Speculation on the generality of the backward stepwise view of PCA
A novel backwards viewpoint of Principal Component Analysis is proposed. In a wide variety of cases, that fall into the area of Object Oriented Data Analysis, this viewpoint is se...
J. S. Marron, Sungkyu Jung, Ian L. Dryden
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
14 years 10 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson