8437 search results - page 171 / 1688 » Preferences over Sets |
162
click to vote
DEBU
2006
15 years 6 months ago
2006
The Web contains a vast amount of text that can only be queried using simple keywords-in, documentsout search queries. But Web text often contains structured elements, such as hot...
163
click to vote
MST
2008
15 years 6 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
146
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
174
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—The two-server model is quite promising for password based authentication, well suited for the setting of federated enterprises. However, none of the existing two-server passwor...
191
click to vote
TCOM
2008
15 years 4 months ago
2008
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...