Sciweavers

7015 search results - page 198 / 1403
» Approximation algorithms for co-clustering
Sort
View
EWC
2007
93views more  EWC 2007»
15 years 6 months ago
Approximation of involute curves for CAD-system processing
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa,...
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 7 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
JCT
2006
100views more  JCT 2006»
15 years 6 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 6 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
ICML
2009
IEEE
16 years 7 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint