Sciweavers

1451 search results - page 42 / 291
» Order independence and rationalizability
Sort
View
ICIP
2010
IEEE
15 years 3 months ago
A fast Multilinear ICA algorithm
We extend our previous work on Multilinear Independent Component Analysis (MICA) by introducing a Fast-MICA algorithm that demonstrates the same improvement over classical ICA as ...
Raghu G. Raj, Alan C. Bovik
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 8 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
FORMATS
2010
Springer
15 years 4 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
JCT
2000
96views more  JCT 2000»
15 years 6 months ago
On Tail Distribution of Interpost Distance
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
Jeong Han Kim, Boris Pittel
MICRO
2002
IEEE
121views Hardware» more  MICRO 2002»
15 years 6 months ago
Convergent scheduling
Convergent scheduling is a general framework for instruction scheduling and cluster assignment for parallel, clustered architectures. A convergent scheduler is composed of many ind...
Walter Lee, Diego Puppin, Shane Swenson, Saman P. ...