Sciweavers

1439 search results - page 77 / 288
» Fast approximation of centrality
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
15 years 11 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 11 days ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
BMCBI
2007
172views more  BMCBI 2007»
14 years 10 months ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
GLOBECOM
2007
IEEE
15 years 4 months ago
ICI Canceling Space-Frequency Block Code for MISO-OFDM in Fast Fading Channels
— An intercarrier interference (ICI) canceling technique for multiple-input single-output (MISO) orthogonal frequency division multiplexing (OFDM) systems in fast fading channels...
Jae Yeun Yun, Eui-Rim Jeong, Jongguk Ahn, Jongtae ...
ICCV
2011
IEEE
14 years 5 days ago
Fast Template Matching in Non-Linear Tone-Mapped Images
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
Yacov Hel-Or, Hagit Hel-Or and Eyal David