|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 519 occurrences of 330 keywords
|
|
|
Results
Found 1666 publication records. Showing 1666 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
149 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
118 | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan |
Fast distributed random walks. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
metropolis-hastings sampling, distributed algorithm, random walks, random sampling |
113 | David Gamarnik |
On deciding stability of constrained random walks and queueing systems. |
SIGMETRICS Perform. Evaluation Rev. |
2001 |
DBLP DOI BibTeX RDF |
|
99 | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali |
Efficient distributed random walks with applications. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time |
95 | Noga Alon, Chen Avin, Michal Koucký 0001, Gady Kozma, Zvi Lotker, Mark R. Tuttle |
Many random walks are faster than one. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
distributed algorithms, random walks, graph search, speed-up, cover time |
88 | Francis Otto, Song Ouyang |
Improving Search in Unstructured P2P Systems: Intelligent Walks (I-Walks). |
IDEAL |
2006 |
DBLP DOI BibTeX RDF |
Random Walks and Intelligent Walks, Search, Unstructured P2P |
87 | René Schott |
Random Walks on Trees. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
method of Darboux, generator, tree, Random walk, generating function, dynamic data structure, asymptotic behavior |
85 | Jérôme Callut, Kevin Françoisse, Marco Saerens, Pierre Dupont |
Semi-supervised Classification from Discriminative Random Walks. |
ECML/PKDD (1) |
2008 |
DBLP DOI BibTeX RDF |
|
85 | Colin Cooper, Alan M. Frieze, Tomasz Radzik |
Multiple Random Walks and Interacting Particle Systems. |
ICALP (2) |
2009 |
DBLP DOI BibTeX RDF |
|
78 | Richard Rzeszutek, Thomas F. El-Maraghi, Dimitrios Androutsos |
Scale-Space Random Walks. |
CCECE |
2009 |
DBLP DOI BibTeX RDF |
|
73 | Thomas Sauerwald |
Expansion and the cover time of parallel random walks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
random walks, expander, expansion, cover time |
71 | Chen Avin, Bhaskar Krishnamachari |
The power of choice in random walks: an empirical study. |
MSWiM |
2006 |
DBLP DOI BibTeX RDF |
RandomWalks, power of choice, wireless networks |
69 | Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan |
MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers. |
CT-RSA |
2007 |
DBLP DOI BibTeX RDF |
cryptanalysis, stream cipher, random walks, expander graph |
66 | Gerhard Haßlinger, Sebastian Kempken |
Efficiency of random walks for search in different network structures. |
VALUETOOLS |
2007 |
DBLP DOI BibTeX RDF |
coverage of search, random walks, transient analysis |
64 | Marc Bui, Thibault Bernard, Devan Sohier, Alain Bui |
Random Walks in Distributed Computing: A Survey. |
IICS |
2004 |
DBLP DOI BibTeX RDF |
Distributed System, Distributed Algorithms, Random Walks, Electrical Network |
62 | Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, Bhaskar Krishnamachari |
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. |
Comput. Commun. Rev. |
2008 |
DBLP DOI BibTeX RDF |
random walks, empirical evaluation, flooding |
61 | Mohamed Mosbah 0001, Nasser Saheb |
A Syntactic Approach to Random Walks on Graphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
61 | Yiyu Shi 0001, Wei Yao 0002, Jinjun Xiong, Lei He 0001 |
Incremental and on-demand random walk for iterative power distribution network analysis. |
ASP-DAC |
2009 |
DBLP DOI BibTeX RDF |
|
61 | Ming Zhong 0006, Kai Shen, Joel I. Seiferas |
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
Distributed systems, Distributed applications, Distributed networks |
61 | Sergio D. Servetto, Guillermo Barrenechea |
Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks. |
WSNA |
2002 |
DBLP DOI BibTeX RDF |
|
59 | Purnamrita Sarkar, Andrew W. Moore 0001 |
Fast nearest-neighbor search in disk-resident graphs. |
KDD |
2010 |
DBLP DOI BibTeX RDF |
graphs, random walks, external memory, link prediction |
59 | Ni Lao, William W. Cohen |
Fast query execution for retrieval models based on path-constrained random walks. |
KDD |
2010 |
DBLP DOI BibTeX RDF |
filtering and recommending, path-constrained random walks, relational retrieval, learning to rank |
59 | Colin Cooper, Alan M. Frieze |
Random Walks on Random Graphs. |
NanoNet |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Robert Elsässer, Thomas Sauerwald |
Tight Bounds for the Cover Time of Multiple Random Walks. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
54 | Kiran Rachuri, C. Siva Ram Murthy |
Energy Efficient Search in Sensor Networks Using Simple Random Walks with Level Biased Steps. |
ICDCS Workshops |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Guy Fayolle, I. A. Ignatyuk, V. A. Malyshev, M. V. Menshikov |
Random walks in two-dimensional complexes. |
Queueing Syst. Theory Appl. |
1991 |
DBLP DOI BibTeX RDF |
two-dimensional complexes, transience, hedgehog, Random walks, ergodicity |
52 | Bruno Vilhena Adorno, Geovany de Araújo Borges |
iARW: An incremental path planner algorithm based on adaptive random walks. |
IROS |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Rui Shen 0002, Irene Cheng 0001, Xiaobo Li 0001, Anup Basu |
Stereo matching using random walks. |
ICPR |
2008 |
DBLP DOI BibTeX RDF |
|
50 | Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani |
Quantum walks on graphs. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
50 | Jieyu Zhao |
Live facial feature extraction. |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
live facial feature extraction, anisotropic diffusion process, random walks, statistical shape analysis |
50 | Brian F. Cooper |
An Optimal Overlay Topology for Routing Peer-to-Peer Searches. |
Middleware |
2005 |
DBLP DOI BibTeX RDF |
random walks, peer-to-peer search, overlay topology |
50 | Thibault Bernard, Alain Bui, Olivier Flauzac |
Random Distributed Self-stabilizing Structures Maintenance. |
ISSADS |
2004 |
DBLP DOI BibTeX RDF |
distributed systems, self-stabilization, random walks |
47 | Xiaoming Liu 0004, Jun Liu 0011, Zhilin Feng |
Colorization Using Segmentation with Random Walk. |
CAIP |
2009 |
DBLP DOI BibTeX RDF |
image segmentation, random walks, colorization, graph cut |
47 | Barbara Poblete, Carlos Castillo 0001, Aristides Gionis |
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph. |
CIKM |
2008 |
DBLP DOI BibTeX RDF |
search engine queries, structure mining, random-walks, web graphs, usage mining |
47 | Henning Meyerhenke, Thomas Sauerwald |
Analyzing Disturbed Diffusion on Networks. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
Disturbed diffusion, Diffusion distance, Random walks |
47 | Avrim Blum, Dawn Xiaodong Song, Shobha Venkataraman |
Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds. |
RAID |
2004 |
DBLP DOI BibTeX RDF |
Random walks, Network intrusion detection, Stepping stones, Evasion, Interactive sessions |
47 | Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse |
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? |
PODC |
2010 |
DBLP DOI BibTeX RDF |
faulty networks, distributed computing, mobile agents, random walks, expanders |
45 | Xianfang Sun, Paul L. Rosin, Ralph R. Martin, Frank C. Langbein |
Random walks for mesh denoising. |
Symposium on Solid and Physical Modeling |
2007 |
DBLP DOI BibTeX RDF |
random walk, mesh smoothing, feature preservation, mesh denoising |
43 | Jesse S. A. Bridgewater, P. Oscar Boykin, Vwani P. Roychowdhury |
Balanced Overlay Networks (BON): An Overlay Technology for Decentralized Load Balancing. |
IEEE Trans. Parallel Distributed Syst. |
2007 |
DBLP DOI BibTeX RDF |
load balancing, Distributed computing, randomized algorithms, random walks, random graphs |
42 | Pablo Navarrete Michelini, Edward J. Coyle |
Mobility models based on correlated random walks. |
Mobility Conference |
2008 |
DBLP DOI BibTeX RDF |
absorbing times, correlated random walk, mobility model, algebraic multigrid |
40 | Zhijun Yin, Manish Gupta 0001, Tim Weninger, Jiawei Han 0001 |
A Unified Framework for Link Recommendation Using Random Walks. |
ASONAM |
2010 |
DBLP DOI BibTeX RDF |
link recommendation, edge weighting, random walks |
40 | Alain Bui, Abdurusul Kudireti, Devan Sohier |
A Fully Distributed Clustering Algorithm Based on Random Walks. |
ISPDC |
2009 |
DBLP DOI BibTeX RDF |
Clustering, distributed algorithms, random walks |
40 | Mostafa Keikha, Mark James Carman, Fabio Crestani |
Blog distillation using random walks. |
SIGIR |
2009 |
DBLP DOI BibTeX RDF |
random walks, blog retrieval |
40 | Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar, Deepak Ravichandran, Mohamed Aly 0002 |
Video suggestion and discovery for youtube: taking random walks through the view graph. |
WWW |
2008 |
DBLP DOI BibTeX RDF |
recommendation systems, collaborative filtering, random walks, video search, label propagation |
40 | Yu-Kun Lai, Shi-Min Hu 0001, Ralph R. Martin, Paul L. Rosin |
Fast mesh segmentation using random walks. |
Symposium on Solid and Physical Modeling |
2008 |
DBLP DOI BibTeX RDF |
interactive, random walks, mesh segmentation |
40 | Leo J. Grady |
Random Walks for Image Segmentation. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2006 |
DBLP DOI BibTeX RDF |
combinatorial Dirichlet problem, boundary completion, Image segmentation, graph theory, random walks, graph cuts, Laplace equation, harmonic functions, interactive segmentation |
40 | Dimitris Bertsimas, Santosh S. Vempala |
Solving convex programs by random walks. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
random walks, polynomial time, Convex programs |
40 | Ben Morris, Alistair Sinclair |
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
0-1 knapsack problem, balanced almost uniform permutations, the hypercube, Markov chains, Random walks, multicommodity flow, approximate counting, random permutations, rapid mixing |
40 | David Gillman |
A Chernoff bound for random walks on expander graphs |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
Ising system, finite random walk, entropy, random walks, expander graphs, weighted graph, error probability, partition function, Chernoff bound |
40 | Cristopher Moore, Alexander Russell |
Quantum Walks on the Hypercube. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Steven J. Rysavy, Arturo Flores, Reyes Enciso, Kazunori Okada |
Classifiability criteria for refining of random walks segmentation. |
ICPR |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Zeinab Abbassi, Vahab S. Mirrokni |
A Recommender System Based on Local Random Walks and Spectral Methods. |
WebKDD/SNA-KDD |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Ilia Binder, Mark Braverman |
Derandomization of Euclidean Random Walks. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Christian Bierwirth, Dirk C. Mattfeld, Jean-Paul Watson |
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem. |
EvoCOP |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Thibault Bernard, Alain Bui, Marc Bui, Devan Sohier |
A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms. |
ISPDC |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Ran Bachrach, Shai Fine, Eli Shamir 0001 |
Query by Committee, Linear Separation and Random Walks. |
EuroCOLT |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Prateek Mittal, Nikita Borisov |
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies. |
CCS |
2009 |
DBLP DOI BibTeX RDF |
peer-to-peer, anonymity, random walks |
38 | Shehla Abbas, Mohamed Mosbah 0001, Akka Zemmari |
A Generic Distributed Algorithm for Computing by Random Mobile Agents. |
PRIMA |
2007 |
DBLP DOI BibTeX RDF |
Distributed Algorithms, Mobile Agents, Random Walks |
38 | Prasad Chalasani, Somesh Jha, Isaac Saias |
Approximate Option Pricing. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Binomial model, Path-dependent options, Asian options, Computational complexity, Random walks, Option pricing |
38 | Andris Ambainis |
Quantum Random Walks - New Method for Designing Quantum Algorithms. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Ming Zhong 0006, Kai Shen |
Random walk based node sampling in self-organizing networks. |
ACM SIGOPS Oper. Syst. Rev. |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Radu Grosu, Xiaowan Huang, Scott A. Smolka, Wenkai Tan, Stavros Tripakis |
Deep Random Search for Efficient Model Checking of Timed Automata. |
Monterey Workshop |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying Ma, Changshui Zhang |
Multiple random walk and its application in content-based image retrieval. |
Multimedia Information Retrieval |
2005 |
DBLP DOI BibTeX RDF |
Markov random walk, class prior, image retrieval, relevance feedback, generative model, likelihood function |
38 | Mikhail Menshikov, Dimitri Petritis, Serguei Popov 0001 |
Bindweeds or random walks in random environments on multiplexed trees and their asympotics. |
DRW |
2003 |
DBLP BibTeX RDF |
|
36 | Eldar Sadikov, Jayant Madhavan, Lu Wang, Alon Y. Halevy |
Clustering query refinements by user intent. |
WWW |
2010 |
DBLP DOI BibTeX RDF |
clustering, random walks, query refinements |
36 | Fang Wei, Weining Qian, Chen Wang 0020, Aoying Zhou |
Detecting Overlapping Community Structures in Networks. |
World Wide Web |
2009 |
DBLP DOI BibTeX RDF |
overlapping community structure, seed expansion, modularity function, random walks |
36 | Changshui Zhang, Feiping Nie 0001, Shiming Xiang, Chenping Hou |
Soft Constraint Harmonic Energy Minimization for Transductive Learning and its Two Interpretations. |
Neural Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
Soft label soft constraint, Classification, Random walks, Transductive learning, Label propagation |
36 | Pavel Serdyukov, Henning Rode, Djoerd Hiemstra |
Modeling multi-step relevance propagation for expert finding. |
CIKM |
2008 |
DBLP DOI BibTeX RDF |
language models, markov processes, random walks, expertise, enterprise search, expert finding |
36 | Jana Urban, Joemon M. Jose |
Adaptive image retrieval using a Graph model for semantic feature integration. |
Multimedia Information Retrieval |
2006 |
DBLP DOI BibTeX RDF |
image retrieval, relevance feedback, random walks, fusion, retrieval models, semantic features |
36 | Ioannis Chatzigiannakis, Sotiris E. Nikoletseas |
Design and Analysis of an Efficient Communication Strategy for Hierarchical and Highly Changing Ad-hoc Mobile Networks. |
Mob. Networks Appl. |
2004 |
DBLP DOI BibTeX RDF |
ad-hoc mobile networks, routing, random walks, experimental evaluation, average case analysis |
36 | Ronny Lempel, Shlomo Moran |
SALSA: the stochastic approach for link-structure analysis. |
ACM Trans. Inf. Syst. |
2001 |
DBLP DOI BibTeX RDF |
TKC effect, WEB, random walks, SALSA, Link-structure analysis, hubs and authorities |
36 | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou |
Locating Information with Uncertainty in Fully Interconnected Networks. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
Information Retrieval, Search, Uncertainty, Random Walks, Complete Network |
36 | Nabil Kahalé |
Eigenvalues and Expansion of Regular Graphs. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs |
35 | Qianbing Zheng, Yongwen Wang, Xicheng Lu |
WCBF: Efficient and High-Coverage Search Schema in Unstructured Peer-to-Peer Network. |
GCC |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Thang H. Bui, Albert Nymeyer |
Formal Verification Based on Guided Random Walks. |
IFM |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Issam Mabrouki, Gwillerm Froc, Xavier Lagrange |
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks. |
QEST |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Anne-Marie Kermarrec, Erwan Le Merrer, Bruno Sericola, Gilles Trédan |
Evaluating the Quality of a Network Topology through Random Walks. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Jiayuan Huang, Tingshao Zhu, Dale Schuurmans |
Web Communities Identification from Random Walks. |
PKDD |
2006 |
DBLP DOI BibTeX RDF |
|
35 | David Gamarnik |
Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. |
SIGMETRICS Perform. Evaluation Rev. |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Seema Bandyopadhyay, Edward J. Coyle, Tillmann Falck |
Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks. |
IEEE Trans. Mob. Comput. |
2007 |
DBLP DOI BibTeX RDF |
correlated random walk, MANET, random walk, mobility models, random waypoint model |
33 | Markus Franke, Andreas Geyer-Schulz |
A Method for Analyzing the Asymptotic Behavior of the Walk Process in Restricted Random Walk Cluster Algorithm. |
GfKl |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Elvira Moreno, Mauricio Velasco |
On random walks and switched random walks on homogeneous spaces. |
Comb. Probab. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
33 | Miquel Montero |
Random Walks with Invariant Loop Probabilities: Stereographic Random Walks. |
Entropy |
2021 |
DBLP DOI BibTeX RDF |
|
33 | Giang Hoang Nguyen, John Boaz Lee, Ryan A. Rossi, Nesreen K. Ahmed, Eunyee Koh, Sungchul Kim |
Dynamic Network Embeddings: From Random Walks to Temporal Random Walks. |
IEEE BigData |
2018 |
DBLP DOI BibTeX RDF |
|
33 | Chen Avin, Yuval Lando, Zvi Lotker |
Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs) |
CoRR |
2009 |
DBLP BibTeX RDF |
|
33 | Philippe Marchal |
Constructing a sequence of random walks strongly converging to Brownian motion. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Massimiliano Mattera |
Annihilating random walks and perfect matchings of planar graphs. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Nisheeth K. Vishnoi |
Non Uniform Random Walks. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | András Telcs |
The volume and time comparison principle and transition probability estimates for random walks. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Saibal Mitra, Bernard Nienhuis |
Osculating Random Walks on Cylinders. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Michael Drmota |
Discrete Random Walks on One-Sided "Periodic" Graphs. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Serguei Yu. Popov 0001 |
Frogs and some other interacting random walks models. |
DRW |
2003 |
DBLP BibTeX RDF |
|
33 | Leonidas Tzevelekas, Ioannis Stavrakakis |
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks. |
WOWMOM |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Vandana Pursnani Janeja, Vijayalakshmi Atluri |
Random Walks to Identify Anomalous Free-Form Spatial Scan Windows. |
IEEE Trans. Knowl. Data Eng. |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Expander Properties and the Cover Time of Random Intersection Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Yoshiaki Nonaka, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita |
How to Design a Linear Cover Time Random Walk on a Finite Graph. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Charles Zhang, Hans-Arno Jacobsen |
Efficiently mining crosscutting concerns through random walks. |
AOSD |
2007 |
DBLP DOI BibTeX RDF |
aspect discovery, crosscutting concern discovery, aspect mining |
31 | Jaikumar Radhakrishnan |
Gap Amplification in PCPs Using Lazy Random Walks. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Leo J. Grady, Thomas Schiwietz, Shmuel Aharon, Rüdiger Westermann |
Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation. |
MICCAI (2) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Markus Franke, Andreas Geyer-Schulz |
Automated Indexing with Restricted Random Walks on Large Document Sets. |
ECDL |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1666 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|