5130 search results - page 308 / 1026 » Constraint Query Languages |
168
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
187
click to vote
TON
2012
13 years 9 months ago
2012
—Cognitive Radio (CR) technology has great potential to alleviate spectrum scarcity in wireless communications. It allows secondary users (SUs) to opportunistically access spectr...
205
click to vote
JUCS
2006
15 years 6 months ago
2006
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
147
click to vote
BTW
2007
Springer
16 years 24 days ago
2007
Springer
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
157
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...