Sciweavers

63 search results - page 12 / 13
» Minimizing NFA's and Regular Expressions
Sort
View
MFCS
2009
Springer
14 years 3 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
BMCBI
2005
190views more  BMCBI 2005»
13 years 8 months ago
An Entropy-based gene selection method for cancer classification using microarray data
Background: Accurate diagnosis of cancer subtypes remains a challenging problem. Building classifiers based on gene expression data is a promising approach; yet the selection of n...
Xiaoxing Liu, Arun Krishnan, Adrian Mondry
WWW
2010
ACM
14 years 3 months ago
A scalable machine-learning approach for semi-structured named entity recognition
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predeļ¬ned categories. Although extensive research has focused on the de...
Utku Irmak, Reiner Kraft
IPMI
2007
Springer
14 years 9 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
FOSSACS
2009
Springer
14 years 13 days ago
On Omega-Languages Defined by Mean-Payoff Conditions
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weis...