7228 search results - page 1406 / 1446 » From Algorithmic to Subjective Randomness |
180
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
178
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
160
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
161
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
155
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...