Sciweavers

138 search results - page 22 / 28
» A Generalized Sampling Theorem for Reconstructions in Arbitr...
Sort
View
ISPASS
2006
IEEE
14 years 1 months ago
Branch trace compression for snapshot-based simulation
We present a scheme to compress branch trace information for use in snapshot-based microarchitecture simulation. The compressed trace can be used to warm any arbitrary branch pred...
Kenneth C. Barr, Krste Asanovic
BMCBI
2008
166views more  BMCBI 2008»
13 years 7 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
COMPGEOM
2009
ACM
13 years 5 months ago
Geometric tomography: a limited-view approach for computed tomography
Computed tomography(CT), especially since the introduction of helical CT, provides excellent visualization of the internal organs of the body. As a result, CT is used routinely in...
Peter B. Noël, Jinhui Xu, Kenneth R. Hoffmann...
WWW
2002
ACM
14 years 8 months ago
OCTOPUS: aggressive search of multi-modality data using multifaceted knowledge base
An important trend in Web information processing is the support of multimedia retrieval. However, the most prevailing paradigm for multimedia retrieval, content-based retrieval (C...
Jun Yang 0003, Qing Li, Yueting Zhuang
COLT
1999
Springer
13 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon