Sciweavers

5128 search results - page 360 / 1026
» When Abstraction Fails
Sort
View
205
Voted
TR
2008
88views more  TR 2008»
15 years 7 months ago
Reliability Sampling Plans Under Progressive Type-I Interval Censoring Using Cost Functions
Abstract--This paper gives a reliability sampling plan for progressively type I interval censored life tests when the lifetime follows the exponential distribution. We use the maxi...
Syuan-Rong Huang, Shuo-Jye Wu
COGSCI
2004
82views more  COGSCI 2004»
15 years 7 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
155
Voted
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
15 years 7 months ago
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
ENTCS
2002
90views more  ENTCS 2002»
15 years 7 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
JSAC
2000
97views more  JSAC 2000»
15 years 7 months ago
A differential detection scheme for transmit diversity
Abstract--We present a transmission scheme for exploiting diversity given by two transmit antennas when neither the transmitter nor the receiver has access to channel state informa...
Vahid Tarokh, Hamid Jafarkhani