Sciweavers

1810 search results - page 9 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
14 years 1 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
14 years 8 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...
IGARSS
2009
13 years 5 months ago
A Novel STAP Algorithm using Sparse Recovery Technique
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
Ke Sun, Hao Zhang, Gang Li, Huadong Meng, Xiqin Wa...