Sciweavers

189 search results - page 3 / 38
» Polynomial-time Computation via Local Inference Relations
Sort
View
RTA
2010
Springer
15 years 1 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
ECCC
2006
145views more  ECCC 2006»
14 years 9 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
ISBRA
2009
Springer
15 years 4 months ago
Imputation-Based Local Ancestry Inference in Admixed Populations
Abstract. Accurate inference of local ancestry from whole-genome genetic variation data is critical for understanding the history of admixed human populations and detecting SNPs as...
Bogdan Pasaniuc, Justin Kennedy, Ion I. Mandoiu
ACCV
2010
Springer
14 years 4 months ago
Network Connectivity via Inference over Curvature-Regularizing Line Graphs
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
Maxwell D. Collins, Vikas Singh, Andrew L. Alexand...
COLING
2010
14 years 4 months ago
Enhancing Multi-lingual Information Extraction via Cross-Media Inference and Fusion
We describe a new information fusion approach to integrate facts extracted from cross-media objects (videos and texts) into a coherent common representation including multi-level ...
Adam Lee, Marissa Passantino, Heng Ji, Guojun Qi, ...