6045 search results - page 299 / 1209 » Computable Linearizations of Well-partial-orderings |
197
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
212
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
205
click to vote
ASIACRYPT
2008
Springer
15 years 9 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
184
click to vote
IOR
2006
15 years 7 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
210
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...