Sciweavers

598 search results - page 32 / 120
» Approximation Algorithms for the Bottleneck Stretch Factor P...
Sort
View
SIAMSC
2008
118views more  SIAMSC 2008»
13 years 8 months ago
Splitting Methods Based on Algebraic Factorization for Fluid-Structure Interaction
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
Santiago Badia, Annalisa Quaini, Alfio Quarteroni
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 10 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
FOCS
2003
IEEE
14 years 1 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...
ICFCA
2009
Springer
14 years 3 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
GRC
2010
IEEE
13 years 9 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil