Sciweavers

2880 search results - page 320 / 576
» Approximate Range Searching
Sort
View
139
Voted
WWW
2007
ACM
16 years 4 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
WINE
2009
Springer
202views Economy» more  WINE 2009»
15 years 10 months ago
A New Ranking Scheme of the GSP Mechanism with Markovian Users
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
Xiaotie Deng, Jiajin Yu
EMO
2009
Springer
140views Optimization» more  EMO 2009»
15 years 8 months ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 3 months ago
An exploratory study of Google Scholar
Purpose – This paper2 discusses the new scientific search service Google Scholar (GS). This search engine, intended for searching exclusively scholarly documents, will be descri...
Philipp Mayr, Anne-Kathrin Walter
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 27 days ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau