Sciweavers

369 search results - page 65 / 74
» An Improved Generalized Discriminant Analysis for Large-Scal...
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
DGO
2007
133views Education» more  DGO 2007»
13 years 9 months ago
A toolbox for the choice of indicator classes for ranking of watersheds
There has been considerable work on determining a suitable method to accomplish a satisfactory ordering of a group of objects, when there are multiple evaluation criteria. A weigh...
K. Sham Bhat
ISBI
2008
IEEE
14 years 8 months ago
Advanced level-set based multiple-cell segmentation and tracking in time-lapse fluorescence microscopy images
Segmentation and tracking of cells in fluorescence microscopy image sequences is an important task in many biological studies into cell migration as well as intracellular dynamics...
Oleh Dzyubachyk, Wiro J. Niessen, Erik H. W. Meije...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
ICFCA
2009
Springer
14 years 2 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...