Sciweavers

338 search results - page 26 / 68
» Fast distributed random walks
Sort
View
75
Voted
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
15 years 6 months ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
SIGIR
2006
ACM
15 years 3 months ago
Topical link analysis for web search
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
Lan Nie, Brian D. Davison, Xiaoguang Qi
MIDDLEWARE
2005
Springer
15 years 3 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
68
Voted
JSAC
2007
124views more  JSAC 2007»
14 years 9 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock
APJOR
2010
118views more  APJOR 2010»
14 years 8 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura