3257 search results - page 176 / 652 » Some Results on Effective Randomness |
NDQA
2003
14 years 11 months ago
2003
We focused on two issues: answer selection and confidence estimation. We found that some simple constraints on the candidate answers can improve a pure IR-based technique for answ...
IJON
2006
14 years 10 months ago
2006
: In this paper, an image binarization method based on a new discriminant criterion is proposed. The criterion emphasizes much the homogeneity of the object gray level distribution...
RSA
2010
14 years 8 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
107
click to vote
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
83
Voted
ASIAMS
2007
IEEE
15 years 4 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...