Sciweavers

759 search results - page 75 / 152
» Odometers on Regular Languages
Sort
View
JIIS
2008
95views more  JIIS 2008»
14 years 10 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière
TACAS
2007
Springer
117views Algorithms» more  TACAS 2007»
15 years 4 months ago
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...
VL
2006
IEEE
15 years 3 months ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry
PLDI
2011
ACM
14 years 23 days ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
EMNLP
2009
14 years 7 months ago
Mining Search Engine Clickthrough Log for Matching N-gram Features
User clicks on a URL in response to a query are extremely useful predictors of the URL's relevance to that query. Exact match click features tend to suffer from severe data s...
Huihsin Tseng, Longbin Chen, Fan Li, Ziming Zhuang...