Sciweavers

1983 search results - page 64 / 397
» Competitive graph searches
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Querying the Web Graph - (Invited Talk)
This paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of ...
Marc Najork
EMNLP
2009
13 years 5 months ago
Statistical Bistratal Dependency Parsing
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
Richard Johansson
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
TKDE
2008
154views more  TKDE 2008»
13 years 7 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
14 years 1 months ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton