Sciweavers

7015 search results - page 310 / 1403
» Approximation algorithms for co-clustering
Sort
View
SMI
2010
IEEE
228views Image Analysis» more  SMI 2010»
15 years 5 months ago
Hierarchical Spline Approximation of the Signed Distance Function
We present a method to compute the medial axis of a smooth curve or surface by using PHT-spline (polynomial splines over hierarchical T-meshes) hierarchical approximation. In part...
Xinghua Song, Bert Jüttler, Adrien Poteaux
TCBB
2010
166views more  TCBB 2010»
15 years 5 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
PROPERTYTESTING
2010
15 years 4 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
GIS
2007
ACM
16 years 7 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
182
Voted
ICML
2003
IEEE
16 years 7 months ago
Modified Logistic Regression: An Approximation to SVM and Its Applications in Large-Scale Text Categorization
Logistic Regression (LR) has been widely used in statistics for many years, and has received extensive study in machine learning community recently due to its close relations to S...
Jian Zhang, Rong Jin, Yiming Yang, Alexander G. Ha...