Sciweavers

600 search results - page 69 / 120
» Problems and results in extremal combinatorics - II
Sort
View
SC
2000
ACM
14 years 24 days ago
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to mi...
Kirk Schloegel, George Karypis, Vipin Kumar
HIS
2001
13 years 10 months ago
Linear Discriminant Text Classification in High Dimension
Abstract. Linear Discriminant (LD) techniques are typically used in pattern recognition tasks when there are many (n >> 104 ) datapoints in low-dimensional (d < 102 ) spac...
András Kornai, J. Michael Richards
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
ICML
2010
IEEE
13 years 10 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
CVIU
2008
109views more  CVIU 2008»
13 years 9 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios