Sciweavers

1211 search results - page 50 / 243
» Computing Manipulations of Ranking Systems
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
MKM
2007
Springer
14 years 1 months ago
Methods of Relevance Ranking and Hit-content Generation in Math Search
To be effective and useful, math search systems must not only maximize precision and recall, but also present the query hits in a form that makes it easy for the user to identify...
Abdou Youssef
RTA
2010
Springer
13 years 11 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
ISSAC
2005
Springer
94views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Domains and expressions: an interface between two approaches to computer algebra
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
Cosmin E. Oancea, Stephen M. Watt
IWANN
2005
Springer
14 years 1 months ago
Characterizing Self-developing Biological Neural Networks: A First Step Towards Their Application to Computing Systems
Carbon nanotubes are often seen as the only alternative technology to silicon transistors. While they are the most likely short-term alternative, other longer-term alternatives sho...
Hugues Berry, Olivier Temam