Sciweavers

2778 search results - page 157 / 556
» Limit complexities revisited
Sort
View
ICLP
2009
Springer
16 years 7 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen
OSDI
2004
ACM
16 years 6 months ago
Boxwood: Abstractions as the Foundation for Storage Infrastructure
Abstractions as the Foundation for Storage Infrastructure John MacCormick, Nick Murphy, Marc Najork, Chandramohan A. Thekkath, and Lidong Zhou Microsoft Research Silicon Valley Wr...
John MacCormick, Nick Murphy, Marc Najork, Chandra...
ICCAD
2002
IEEE
152views Hardware» more  ICCAD 2002»
16 years 3 months ago
Efficient instruction encoding for automatic instruction set design of configurable ASIPs
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
Jong-eun Lee, Kiyoung Choi, Nikil Dutt
LCTRTS
2010
Springer
16 years 1 months ago
Elastic computing: a framework for transparent, portable, and adaptive multi-core heterogeneous computing
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
John Robert Wernsing, Greg Stitt
COMPLEX
2009
Springer
16 years 1 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang