Sciweavers

3145 search results - page 195 / 629
» Algebraic Linear Orderings
Sort
View
COMPGEOM
2001
ACM
15 years 8 months ago
Hierarchical morse complexes for piecewise linear 2-manifolds
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
Herbert Edelsbrunner, John Harer, Afra Zomorodian
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 5 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
ICC
2007
IEEE
107views Communications» more  ICC 2007»
15 years 11 months ago
MLSE for DSTBC-OFDM Detection with Channel Estimation by Blind Linear Prediction and Subcarriers Interpolation
— This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-...
Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi ...
COMPGEOM
2006
ACM
15 years 10 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
15 years 9 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky