Sciweavers

8582 search results - page 1467 / 1717
» Here or There
Sort
View
RTA
2010
Springer
15 years 10 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
RTA
2010
Springer
15 years 10 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano
CSL
2009
Springer
15 years 10 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
CVPR
2009
IEEE
15 years 10 months ago
ImageNet: A large-scale hierarchical image database
The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images a...
Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai...
« Prev « First page 1467 / 1717 Last » Next »