Sciweavers

144 search results - page 22 / 29
» Complexity Results for Modal Dependence Logic
Sort
View
ICS
2004
Tsinghua U.
14 years 25 days ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
ICLP
1997
Springer
13 years 11 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
HPCA
2006
IEEE
14 years 7 months ago
An approach for implementing efficient superscalar CISC processors
An integrated, hardware / software co-designed CISC processor is proposed and analyzed. The objectives are high performance and reduced complexity. Although the x86 ISA is targete...
Shiliang Hu, Ilhyun Kim, Mikko H. Lipasti, James E...
ISCA
2011
IEEE
271views Hardware» more  ISCA 2011»
12 years 11 months ago
CRIB: consolidated rename, issue, and bypass
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
Erika Gunadi, Mikko H. Lipasti
CIKM
2008
Springer
13 years 9 months ago
Academic conference homepage understanding using constrained hierarchical conditional random fields
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
Xin Xin, Juanzi Li, Jie Tang, Qiong Luo