Sciweavers

828 search results - page 52 / 166
» Bounded Hairpin Completion
Sort
View
84
Voted
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 4 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
106
Voted
AHSWN
2010
102views more  AHSWN 2010»
15 years 22 days ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 18 days ago
Multiple Access Channels with State Information Known at Some Encoders
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...
Shivaprasad Kotagiri, J. Nicholas Laneman
94
Voted
JGAA
2007
104views more  JGAA 2007»
15 years 14 days ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
SEMWEB
2010
Springer
14 years 10 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider