Sciweavers

927 search results - page 130 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
117
Voted
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 2 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
106
Voted
LICS
2009
IEEE
15 years 7 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 3 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
114
Voted
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
94
Voted
BILDMED
2007
134views Algorithms» more  BILDMED 2007»
15 years 2 months ago
Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes
Abstract. Diffusion tensor imaging provides information about structure and location of white matter tracts within the human brain which is of particular interest for neurosurgery...
Dorit Merhof, Martin Meister, Ezgi Bingöl, Pe...