Sciweavers

7228 search results - page 1406 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CIKM
2009
Springer
15 years 2 months ago
Probabilistic skyline queries
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
Christian Böhm, Frank Fiedler, Annahita Oswal...
CIKM
2009
Springer
15 years 2 months ago
Heterogeneous cross domain ranking in latent space
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...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
CIKM
2009
Springer
15 years 2 months ago
Space-economical partial gram indices for exact substring matching
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...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 2 months ago
Evaluating very large datalog queries on social networks
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...
Royi Ronen, Oded Shmueli
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 2 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
« Prev « First page 1406 / 1446 Last » Next »