Sciweavers

1525 search results - page 44 / 305
» Matching with Regular Constraints
Sort
View
101
Voted
ICPR
2008
IEEE
15 years 10 months ago
A least square kernel machine with box constraints
In this paper, we present a least square kernel machine with box constraints (LSKMBC). The existing least square machines assume Gaussian hyperpriors and subsequently express the ...
Jayanta Basak
122
Voted
MP
2011
14 years 6 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
132
Voted
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 3 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
149
Voted
CC
2005
Springer
195views System Software» more  CC 2005»
15 years 5 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
Luca Padovani
ICML
2007
IEEE
16 years 4 months ago
Simple, robust, scalable semi-supervised learning via expectation regularization
Although semi-supervised learning has been an active area of research, its use in deployed applications is still relatively rare because the methods are often difficult to impleme...
Gideon S. Mann, Andrew McCallum