Sciweavers

1114 search results - page 58 / 223
» Better Construction with Factories
Sort
View
ISPASS
2006
IEEE
15 years 3 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
ICML
2004
IEEE
15 years 3 months ago
Active learning using pre-clustering
The paper is concerned with two-class active learning. While the common approach for collecting data in active learning is to select samples close to the classification boundary,...
Hieu Tat Nguyen, Arnold W. M. Smeulders
68
Voted
SOCO
2010
Springer
14 years 8 months ago
Evolving the memory of a criminal's face: methods to search a face space more effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, ...
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
14 years 7 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders
77
Voted
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
15 years 10 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen