Sciweavers

5090 search results - page 506 / 1018
» Constructing Strategies for Programming
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
16 years 17 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
CIE
2007
Springer
15 years 11 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
ICPR
2008
IEEE
16 years 8 months ago
Graph-based classification for multiple observations of transformed patterns
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
Effrosini Kokiopoulou, Pascal Frossard, Stefanos P...
ICALP
2009
Springer
16 years 1 months ago
Approximating Decision Trees with Multiway Branches
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
ICALP
2009
Springer
16 years 1 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert