Sciweavers

1390 search results - page 90 / 278
» Computing the depth of a flat
Sort
View
EDBT
2000
ACM
15 years 1 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
ISCAPDCS
2007
14 years 11 months ago
Architectural requirements of parallel computational biology applications with explicit instruction level parallelism
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
Naeem Zafar Azeemi
FPGA
1997
ACM
120views FPGA» more  FPGA 1997»
15 years 2 months ago
Partially-Dependent Functional Decomposition with Applications in FPGA Synthesis and Mapping
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
Jason Cong, Yean-Yow Hwang
ICALP
2010
Springer
14 years 12 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ACMDIS
1997
ACM
15 years 2 months ago
Triangles: Design of a Physical/Digital Construction Kit
This paper presents the design of a new form of computer interface that uses physical objects to embody digital information, providing a means for interacting with data. Triangles...
Matthew G. Gorbet, Maggie Orth