Sciweavers

2206 search results - page 413 / 442
» On the power of coercion abstraction
Sort
View
POPL
1989
ACM
13 years 11 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
APWEB
2007
Springer
13 years 11 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
BIBE
2007
IEEE
129views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Statistial Analysis of nucleosome occupancy and histone modification data
Abstract-- In eukaryotic cells, genomic DNAs wrap around beadlike molecules, called nucleosomes, so as to pack more compactly in the nucleus of the cell. The nucleosome is made up ...
Guo-Cheng Yuan, Jun S. Liu
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 11 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams