784 search results - page 64 / 157 » Relaxing the Value Restriction |
119
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
The skyline query returns the most interesting tuples according to a set of explicitly defined preferences among attribute values. This work relaxes this requirement, and allows us...
SAC
2005
ACM
15 years 5 months ago
2005
ACM
Based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a mathematical model of information retrieval based on a fuzzy ...
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
QOFIS
2004
Springer
15 years 4 months ago
2004
Springer
Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can ent...