Sciweavers

1895 search results - page 185 / 379
» Modular Functional Descriptions
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 8 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
ENGL
2007
168views more  ENGL 2007»
13 years 8 months ago
A Novel Star Field Approach for Shape Indexing in CBIR Systems
—This paper presents a novel hybrid method for content based visual information retrieval (CBIR) that combines shape analysis of objects in image with their automatic indexing by...
Oleg Starostenko, Alberto Chávez-Arag&oacut...
IWANN
1997
Springer
14 years 7 days ago
The Pattern Extraction Architecture: A Connectionist Alternative to the Von Neumann Architecture
A detailed connectionist architecture is described which is capable of relating psychological behavior to the functioning of neurons and neurochemicals. The need to be able to bui...
L. Andrew Coward
WWW
2007
ACM
14 years 8 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
POPL
2008
ACM
14 years 8 months ago
From dirt to shovels: fully automatic tool generation from ad hoc data
An ad hoc data source is any semistructured data source for which useful data analysis and transformation tools are not readily available. Such data must be queried, transformed a...
Kathleen Fisher, David Walker, Kenny Qili Zhu, Pet...