Sciweavers

5022 search results - page 917 / 1005
» Data structures and problem solving using Java
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
14 years 1 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DIAGRAMS
2004
Springer
14 years 2 months ago
Bayesian Boxes: A Colored Calculator for Picturing Posteriors
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...
Kevin Burns
WWW
2009
ACM
14 years 9 months ago
Estimating the impressionrank of web pages
The ImpressionRank of a web page (or, more generally, of a web site) is the number of times users viewed the page while browsing search results. ImpressionRank captures the visibi...
Ziv Bar-Yossef, Maxim Gurevich
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 9 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal