Sciweavers

555 search results - page 109 / 111
» Decompositions of Grammar Constraints
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 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
BMCBI
2006
115views more  BMCBI 2006»
13 years 7 months ago
Multivariate curve resolution of time course microarray data
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
Peter D. Wentzell, Tobias K. Karakach, Sushmita Ro...
JAIR
2006
179views more  JAIR 2006»
13 years 7 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 7 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...
CG
2005
Springer
13 years 7 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja