Sciweavers

432 search results - page 20 / 87
» On Notions of Regularity for Data Languages
Sort
View
PAAMS
2010
Springer
13 years 5 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
AAAI
2010
13 years 9 months ago
Kernelized Sorting for Natural Language Processing
Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
Jagadeesh Jagarlamudi, Seth Juarez, Hal Daum&eacut...
XSYM
2005
Springer
84views Database» more  XSYM 2005»
14 years 1 months ago
Patterns and Types for Querying XML Documents
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
Giuseppe Castagna
JMLR
2012
11 years 10 months ago
A Simple Geometric Interpretation of SVM using Stochastic Adversaries
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Roi Livni, Koby Crammer, Amir Globerson
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri