Sciweavers

7006 search results - page 276 / 1402
» Approximation Algorithms
Sort
View
121
Voted
ICML
2004
IEEE
16 years 4 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
149
Voted
DMSN
2004
ACM
15 years 9 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
116
Voted
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 7 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
128
Voted
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
15 years 9 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
130
Voted
ISPAN
1997
IEEE
15 years 8 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal