Sciweavers

4378 search results - page 305 / 876
» On the Complexity of Ordered Colourings
Sort
View
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
ICCD
2004
IEEE
131views Hardware» more  ICCD 2004»
16 years 3 months ago
3D Processing Technology and Its Impact on iA32 Microprocessors
This short paper explores an implementation of a new technology called 3D die stacking and describes research activity at Intel. 3D die stacking is the bonding of two die either f...
Bryan Black, Donald Nelson, Clair Webb, Nick Samra
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
16 years 3 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
CVPR
2010
IEEE
16 years 3 months ago
Spike Train Driven Dynamical Models for Human Actions
We investigate dynamical models of human motion that can support both synthesis and analysis tasks. Unlike coarser discriminative models that work well when action classes are ...
Michalis Raptis, Kamil Wnuk , Stefano Soatto
ICFCA
2009
Springer
16 years 1 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...