Sciweavers

2292 search results - page 276 / 459
» Hierarchical approximation and localization
Sort
View
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
15 years 8 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
IADIS
2004
15 years 8 months ago
Electronic case studies: a problem-based learning approach
E-Cases is an innovative approach to management development. Traditional case studies typically describe a decision or a problem in a real-life setting. E-Cases encourage students...
Philip M. Drinkwater, Christopher P. Holland, K. N...
SEBD
2004
139views Database» more  SEBD 2004»
15 years 8 months ago
A New Histogram-based Technique for Compressing Multi-Dimensional Data
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Sacc...
NETWORKING
2000
15 years 8 months ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 7 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...