Sciweavers

1022 search results - page 77 / 205
» Logspace Complexity of Functions and Structures
Sort
View
DIMACS
2001
14 years 11 months ago
On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...
Andrei Gabrielov, Thierry Zell
IPL
2006
103views more  IPL 2006»
14 years 10 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
VLSID
2003
IEEE
253views VLSI» more  VLSID 2003»
15 years 10 months ago
High Level Synthesis from Sim-nML Processor Models
The design of modern complex embedded systems require a high level of abstraction of the design. The SimnML[1] is a specification language to model processors for such designs. Se...
Souvik Basu, Rajat Moona
ISBI
2007
IEEE
15 years 4 months ago
Prospecting for Live Cell Bioimaging Probes with Cheminformatic Assisted Image Array (caia)
Cheminformatic Assisted Image Array (CAIA) is a data mining and visualization tool linking chemical structures to microscope images of cells incubated with prospective bioimaging ...
Maria M. Posada, Kerby Shedden, Young Tae Chang, Q...
ITP
2010
179views Mathematics» more  ITP 2010»
15 years 1 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler