Sciweavers

4074 search results - page 226 / 815
» Defining Computational Aesthetics
Sort
View
82
Voted
VLDB
1989
ACM
88views Database» more  VLDB 1989»
15 years 4 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
112
Voted
BVAI
2007
Springer
15 years 4 months ago
A Neural Network Model for a View Independent Extraction of Reach-to-Grasp Action Features
Abstract. The aim of this paper is to introduce a novel, biologically inspired approach to extract visual features relevant for controlling and understanding reachto-grasp actions....
Roberto Prevete, Matteo Santoro, Ezio Catanzariti,...
101
Voted
BIOADIT
2006
Springer
15 years 4 months ago
Bio-inspired Organization for Multi-agents on Distributed Systems
Abstract. This paper presents a middleware system for multi-agents on a distributed system as a general test-bed for bio-inspired approaches. The middleware is unique to other appr...
Ichiro Satoh
87
Voted
FOSSACS
2004
Springer
15 years 4 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 4 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin