Sciweavers

1525 search results - page 45 / 305
» Matching with Regular Constraints
Sort
View
145
Voted
IPPS
2006
IEEE
15 years 9 months ago
Power consumption comparison for regular wireless topologies using fault-tolerant beacon vector routing
Fault-tolerant Beacon Vector Routing (FBVR) is an efficient technique for routing in the presence of node failures. Several common wireless topologies exist that can be used with...
Luke Demoracski, Dimiter R. Avresky
121
Voted
ICTCS
2005
Springer
15 years 9 months ago
Error Mining for Regular Expression Patterns
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
Giuseppe Castagna, Dario Colazzo, Alain Frisch
161
Voted
NJC
2006
102views more  NJC 2006»
15 years 3 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
130
Voted
TCS
2008
15 years 2 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
148
Voted
PAAMS
2010
Springer
15 years 1 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...