Sciweavers

315 search results - page 22 / 63
» Better Approximation of Betweenness Centrality
Sort
View
SIGIR
2006
ACM
14 years 3 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
BMCBI
2007
144views more  BMCBI 2007»
13 years 9 months ago
Motif kernel generated by genetic programming improves remote homology and fold detection
Background: Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and ...
Tony Håndstad, Arne J. H. Hestnes, Pål...
GIS
2010
ACM
13 years 8 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
GIS
2009
ACM
14 years 4 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
FOCS
2008
IEEE
14 years 4 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...