Sciweavers

584 search results - page 115 / 117
» Efficient mass decomposition
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
IOR
2006
177views more  IOR 2006»
13 years 8 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
JMLR
2008
169views more  JMLR 2008»
13 years 8 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
JAIR
2006
179views more  JAIR 2006»
13 years 8 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
PAMI
2008
221views more  PAMI 2008»
13 years 8 months ago
Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
Jianzhuang Liu, Liangliang Cao, Zhenguo Li, Xiaoou...