Sciweavers

6315 search results - page 232 / 1263
» Approximating Solution Structure
Sort
View
MOR
2008
109views more  MOR 2008»
15 years 6 months ago
A Unified Theorem on SDP Rank Reduction
We consider the problem of finding a low
Anthony Man-Cho So, Yinyu Ye, Jiawei Zhang
ICML
2002
IEEE
16 years 7 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 6 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 6 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 3 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White