784 search results - page 23 / 157 » Relaxing the Value Restriction |
EUSFLAT
2003
13 years 11 months ago
2003
The traditional query languages used in database management systems require precise and unambiguous queries only. Fuzzy querying were introduced to relax this rigidity and allow t...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
HEURISTICS
2002
13 years 9 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...