4451 search results - page 131 / 891 » On Random Ordering Constraints |
119
click to vote
CPC
2006
15 years 4 months ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
142
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
140
click to vote
ESOP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
126
click to vote
HPCA
2009
IEEE
16 years 5 months ago
2009
IEEE
Realizing scalable cache coherence in the many-core era comes with a whole new set of constraints and opportunities. It is widely believed that multi-hop, unordered on-chip networ...
145
Voted
EMNLP
2006
15 years 6 months ago
2006
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...