The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase k-walk (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1962-1976 (15) 1977-1983 (17) 1984-1988 (21) 1989-1990 (31) 1991-1992 (15) 1993 (19) 1994 (16) 1995 (23) 1996 (23) 1997 (32) 1998 (33) 1999 (39) 2000 (48) 2001 (69) 2002 (96) 2003 (97) 2004 (171) 2005 (176) 2006 (214) 2007 (225) 2008 (285) 2009 (263) 2010 (133) 2011 (125) 2012 (139) 2013 (159) 2014 (166) 2015 (156) 2016 (191) 2017 (211) 2018 (224) 2019 (250) 2020 (242) 2021 (253) 2022 (240) 2023 (255) 2024 (66)
Publication types (Num. hits)
article(2015) book(3) data(2) incollection(25) inproceedings(2663) mastersthesis(1) phdthesis(29)
Venues (Conferences, Journals, ...)
CoRR(413) IROS(74) Quantum Inf. Process.(68) ICRA(49) IEEE Access(34) FOCS(33) Monte Carlo Methods Appl.(33) Sensors(33) Entropy(30) SODA(26) SIGIR(24) ICDM(23) RoboCup(23) J. Appl. Probab.(22) WWW(21) EMBC(20) More (+10 of total 1653)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1887 occurrences of 1185 keywords

Results
Found 4768 publication records. Showing 4738 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
79Liang Zhang A self-adjusting directed random walk approach for enhancing source-location privacy in sensor network routing. Search on Bibsonomy IWCMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF sensor networks privacy, source-location privacy
65Yoshiaki Nonaka, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita How to Design a Linear Cover Time Random Walk on a Finite Graph. Search on Bibsonomy SAGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
62Ravi Bhargava, Ben Serebrin, Francesco Spadini, Srilatha Manne Accelerating two-dimensional page walks for virtualized systems. Search on Bibsonomy ASPLOS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF AMD, nested paging, page walk caching, virtualization, memory management, virtual machine monitor, hypervisor, TLB
59Hui Tian 0001, Hong Shen 0001, Teruo Matsuzawa Random Walk Routing in WSNs with Regular Topologies. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF wireless sensor networks, routing, shortest path, random walk
58Danny Z. Chen, Shuang Luan, Jinhui Xu 0001 An Experimental Study and Comparison of Topological Peeling and Topological Walk. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
58Milena Mihail, Christos H. Papadimitriou On the Random Walk Method for Protocol Testing. Search on Bibsonomy CAV The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
57Allen Cheung, Shao-Wu Zhang, Christian Stricker 0002, Mandyam V. Srinivasan Animal navigation: general properties of directed walks. Search on Bibsonomy Biol. Cybern. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cumulative errors, Sensory noise, Motor noise, Directed walk, Elementary step, Straightness, Correlated random walk, Persistent random walk, Logarithmic spiral, Vectorial navigation, Positional moments, Mean position, Expected position, Positional variance, Axis of intended locomotion, Navigation, General, Curvature, Bias, Dead reckoning, Simple, Path integration, Central limit theorem, Compass
56Seema Bandyopadhyay, Edward J. Coyle, Tillmann Falck Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF correlated random walk, MANET, random walk, mobility models, random waypoint model
54Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan Optimal Algorithms for Two-Guard Walkability of Simple Polygons. Search on Bibsonomy WADS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Yiyu Shi 0001, Wei Yao 0002, Jinjun Xiong, Lei He 0001 Incremental and on-demand random walk for iterative power distribution network analysis. Search on Bibsonomy ASP-DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Hui Tian 0001, Hong Shen 0001, Teruo Matsuzawa RandomWalk Routing for Wireless Sensor Networks. Search on Bibsonomy PDCAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF wireless sensor networks, routing, random walk
48Jodie M. Plumert, Joseph K. Kearney, James F. Cremer, Kara Recker Distance perception in real and virtual environments. Search on Bibsonomy ACM Trans. Appl. Percept. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF large-screen immersive displays, Virtual environments, perception, distance estimation
46Kevyn Collins-Thompson, Jamie Callan Query expansion using random walk models. Search on Bibsonomy CIKM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF semi-supervised learning, random walk, query expansion, pseudo-relevance feedback
46Chen Avin, Carlos Brito 0001 Efficient and robust query processing in dynamic environments using random walk techniques. Search on Bibsonomy IPSN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF sensor networks, query processing, random walk
46Hong Shen 0001, Keqin Li 0001, Yi Pan 0001, Gilbert H. Young, Si-Qing Zheng Performance analysis for dynamic tree embedding in k-partite networks by random walk. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF dynamic tree embedding, k-partite networks, inter-partition load distribution, performance, parallel algorithms, embedding, random walk
46Abdou Youssef A Parallel Algorithm for Random Walk Construction with Application to the Monte Carlo Solution of Partial Differential Equations. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF random walk construction, Monte Carlo solution, irregular boundaries, randomly selected direction, parallel prefix computations, parallel algorithm, parallel algorithms, hypercube, hypercube networks, partial differential equations, partial differential equations, Monte Carlo methods, discontinuities, communication structure
45Yasuhisa Hasegawa, Junho Jang, Yoshiyuki Sankai Cooperative walk control of paraplegia patient and assistive system. Search on Bibsonomy IROS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Zi Yang, Jie Tang 0001, Jing Zhang 0001, Juanzi Li, Bo Gao Topic-Level Random Walk through Probabilistic Model. Search on Bibsonomy APWeb/WAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Takeshi Muto, Barbara Herzberger, Joachim Hermsdörfer, Yoshihiro Miyake, Ernst Pöppel Interactive gait training device "walk-mate" for hemiparetic stroke rehabilitation. Search on Bibsonomy IROS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Jang Hyun Baek, Jae Young Seo, Kyung Hee Kim Performance Evaluation and Comparison of Two Random Walk Models in the PCS Network. Search on Bibsonomy ICOIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Bertrand Neveu, Gilles Trombettoni, Fred W. Glover ID Walk: A Candidate List Strategy with a Simple Diversification Device. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Chiu-Ching Tuan, Chen-Chau Yang A compact normal walk model for PCS networks. Search on Bibsonomy ACM SIGMOBILE Mob. Comput. Commun. Rev. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42Markus Franke, Andreas Geyer-Schulz A Method for Analyzing the Asymptotic Behavior of the Walk Process in Restricted Random Walk Cluster Algorithm. Search on Bibsonomy GfKl The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
42Jung Hee Cheon, Jin Hong 0001, Minkyu Kim Speeding Up the Pollard Rho Method on Prime Fields. Search on Bibsonomy ASIACRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Pollard rho, r-adding walk, prime field, discrete logarithm problem
42Chris Lytridis, Endre E. Kadar, Gurvinder S. Virk A systematic approach to the problem of odour source localisation. Search on Bibsonomy Auton. Robots The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Odour localisation, Chemical diffusion fields, Biological search strategies, Biased random walk, Chemotaxis
41Kiran Rachuri, C. Siva Ram Murthy Energy Efficient Search in Sensor Networks Using Simple Random Walks with Level Biased Steps. Search on Bibsonomy ICDCS Workshops The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
41Jodie M. Plumert, Joseph K. Kearney, James F. Cremer Distance perception in real and virtual environments. Search on Bibsonomy APGV The full citation details ... 2004 DBLP  DOI  BibTeX  RDF large-screen immersive displays, virtual environments, perception, distance estimation
41Andris Ambainis, Eric Bach 0001, Ashwin Nayak 0001, Ashvin Vishwanath, John Watrous One-dimensional quantum walks. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Thomas W. Barr, Alan L. Cox, Scott Rixner Translation caching: skip, don't walk (the page table). Search on Bibsonomy ISCA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF page walk caching, memory management, tlb
39Weiming Lu 0001, Yueting Zhuang, Jiangqin Wu Discovering calligraphy style relationships by Supervised Learning Weighted Random Walk Model. Search on Bibsonomy Multim. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Chinese calligraphy, Style relationships discovery, Weight learning, Feedback, Random walk
39Gwillerm Froc, Issam Mabrouki, Xavier Lagrange Design and performance of wireless data gathering networks based on unicast random walk routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF quality of service (QoS), wireless sensor networks, routing, random walk, data gathering
39Marco Zuniga, Chen Avin, Bhaskar Krishnamachari Using Heterogeneity to Enhance Random Walk-based Queries. Search on Bibsonomy J. Signal Process. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Electrical resistance, Wireless sensor networks, Markov chains, Querying, Random walk
39Mohsen Jamali, Martin Ester TrustWalker: a random walk model for combining trust-based and item-based recommendation. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF trust, recommendation, random walk
39Alan M. Frieze, Páll Melsted, Michael Mitzenmacher An Analysis of Random-Walk Cuckoo Hashing. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Random Walk Algorithm, Cuckoo Hashing
39Hilmi Yildirim, Mukkai S. Krishnamoorthy A random walk method for alleviating the sparsity problem in collaborative filtering. Search on Bibsonomy RecSys The full citation details ... 2008 DBLP  DOI  BibTeX  RDF collaborative filtering, random walk, sparsity
39Roi Blanco, Christina Lioma Random walk term weighting for information retrieval. Search on Bibsonomy SIGIR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF TextRank, random walk algorithm
39Frédéric Magniez, Ashwin Nayak 0001, Jérémie Roland, Miklos Santha Search via quantum walk. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk
39Manos Dramitinos, George D. Stamoulis, Costas Courcoubetis A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation. Search on Bibsonomy ICQT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF resource allocation, random walk, Auctions
39Achilleas Zapranis Testing the Random Walk Hypothesis with Neural Networks. Search on Bibsonomy ICANN (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF stock index, neural networks, random walk, technical analysis, trading strategies, market efficiency
39Bogdan Smolka, Marek Szczepanski, Kostas N. Plataniotis, Anastasios N. Venetsanopoulos Random Walk Approach to Noise Reduction in Color Images. Search on Bibsonomy CAIP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF random walk, noise reduction
38Han Cai, Chul-Ho Lee, Do Young Eun Invariance Property of Isotropic Random Walk Mobility Patterns in Mobile Ad-Hoc Networks. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
38Michel Neuhaus, Horst Bunke A Random Walk Kernel Derived from Graph Edit Distance. Search on Bibsonomy SSPR/SPR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Raz Tamir A Random Walk through Human Associations. Search on Bibsonomy ICDM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Chiu-Ching Tuan, Chen-Chau Yang A New Normal Walk Model for Mesh PCS Networks. Search on Bibsonomy AINA (1) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
38Binhai Zhu On Lawson's Oriented Walk in Random Delaunay Triangulations. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Random Delaunay triangulation, average-case analysis, point location
35Yang Song 0008, Li-wei He Optimal rare query suggestion with implicit user feedback. Search on Bibsonomy WWW The full citation details ... 2010 DBLP  DOI  BibTeX  RDF random walk, pseudo-relevance feedback, query suggestion
35Jan Madsen Validation and testing of sC++ applications. Search on Bibsonomy ECBS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF sC++, Random Walk validation, concurrent version, testing, validation, program verification, search techniques, testing programs
35Lance R. Williams, David W. Jacobs Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience. Search on Bibsonomy ICCV The full citation details ... 1995 DBLP  DOI  BibTeX  RDF stochastic completion fields, illusory contour shape, boundary completion shape, mammalian visual cortex, boundary fragments, vector-field convolutions, maximum likelihood paths, curves of least energy, illusory contours, illusory contour stimuli, computational geometry, probability, edge detection, image recognition, random walk, computer model, lattice, neural nets, maximum likelihood estimation, probability distribution, neural model, image plane
35Katalin Friedl, Shi-Chun Tsai Recycling random bits in parallel. Search on Bibsonomy HICSS (2) The full citation details ... 1995 DBLP  DOI  BibTeX  RDF pseudo-random bits, block concatenation, random bit recycling, short integers, independently generated bit segments, optimal speedup, parallel algorithms, parallel algorithm, random walk, random number generation, arithmetic, expander graph, randomised algorithms, arithmetic operations
34Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali Efficient distributed random walks with applications. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time
34Frédéric Magniez, Ashwin Nayak 0001, Peter C. Richter, Miklos Santha On the hitting times of quantum versus random walks. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Klim Efremenko, Omer Reingold How Well Do Random Walks Parallelize?. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Markov Chains, Random Walks
34Nick Craswell, Martin Szummer Random walks on the click graph. Search on Bibsonomy SIGIR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF models, web search, user behavior, image search, click data
34Andris Ambainis, Julia Kempe, Alexander Rivosh Coins make quantum walks faster. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
34Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan Separating Models of Learning from Correlated and Uncorrelated Data. Search on Bibsonomy COLT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Ming Li 0014, M. Benjamin Dias, Ian H. Jarman, Wael El-Deredy, Paulo J. G. Lisboa Grocery shopping recommendations based on basket-sensitive random walk. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF basket sensitive random walk, grocery shopping recommendation, popularity based performance evaluatoin
32Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks. Search on Bibsonomy ACM Trans. Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Ad hoc networks, random walk, membership service
32Hanghang Tong, Christos Faloutsos, Jia-Yu Pan Random walk with restart: fast solutions and applications. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Relevance score, Random walk with restart, Graph Mining
32Akio Ishikawa, Mehrdad Panahpour Tehrani, Sei Naito, Shigeyuki Sakazawa, Atsushi Koike Free viewpoint video generation for walk-through experience using image-based rendering. Search on Bibsonomy ACM Multimedia The full citation details ... 2008 DBLP  DOI  BibTeX  RDF local region, ray space, walk-through, image-based rendering, free viewpoint video
32Onay Urfalioglu, A. Enis Çetin, Ercan E. Kuruoglu Levy walk evolution for global optimization. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF alpha-stable distribution, levy walk, global optimization, evolutionary optimization, heavy tailed distribution
32Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong, Sheldon X.-D. Tan Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach. Search on Bibsonomy ASP-DAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF programming method, decoupling capacitor budgeting algorithm, random walk approach, decap budgeting algorithm, power ground network design, isolation property, decap optimization process, leakage currents optimization algorithm, refined leakage model, heuristic method
32Arjun Dasgupta, Gautam Das 0001, Heikki Mannila A random walk approach to sampling hidden databases. Search on Bibsonomy SIGMOD Conference The full citation details ... 2007 DBLP  DOI  BibTeX  RDF top-k interfaces, sampling, random walk, hidden databases
32Issam Mabrouki, Xavier Lagrange, Gwillerm Froc Random walk based routing protocol for wireless sensor networks. Search on Bibsonomy VALUETOOLS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF sensor networks, routing, random walk, data gathering
32Shlomi Dolev, Elad Schiller, Jennifer L. Welch Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Ad hoc networks, self-stabilization, random walk, group communication
32Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot RaWMS -: random walk based lightweight membership service for wireless ad hoc network. Search on Bibsonomy MobiHoc The full citation details ... 2006 DBLP  DOI  BibTeX  RDF ad hoc networks, random walk, membership service
32Changhu Wang, Feng Jing, Lei Zhang 0001, HongJiang Zhang Image annotation refinement using random walk with restarts. Search on Bibsonomy ACM Multimedia The full citation details ... 2006 DBLP  DOI  BibTeX  RDF image annotation refinement, random walk with restarts
32Ismo Rakkolainen, Karri T. Palovuori Laser scanning for the interactive walk-through fogScreen. Search on Bibsonomy VRST The full citation details ... 2005 DBLP  DOI  BibTeX  RDF walk-through screen, tracking, touch screen, fogScreen
32Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying Ma, Changshui Zhang Multiple random walk and its application in content-based image retrieval. Search on Bibsonomy Multimedia Information Retrieval The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Markov random walk, class prior, image retrieval, relevance feedback, generative model, likelihood function
32Paul Gustafson, Ying C. MacNab, Sijin Wen On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms. Search on Bibsonomy Stat. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF hybrid Monte Carlo, Langevin Monte Carlo, random walk suppression, Markov chain Monte Carlo, Metropolis-Hastings algorithm
32Mateu Sbert Error and Complexity of Random Walk Monte Carlo Radiosity. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Rendering, random walk, Monte Carlo, radiosity
31Eiichi Ohki, Yasutaka Nakashima, Takeshi Ando, Masakatsu G. Fujie An algorithm of walk phase estimation with only treadmill motor current. Search on Bibsonomy IROS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31John Z. Zhang The Two-Guard Polygon Walk Problem. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Adnan Noor Mian, Roberto Baldoni, Roberto Beraldi An Adapting Random Walk for Ad Hoc and Sensor Networks. Search on Bibsonomy ICDCS Workshops The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Satu Jumisko-Pyykkö, Mandy Weitzel, Ismo Rakkolainen Biting, Whirling, Crawling - Children's Embodied Interaction with Walk-through Displays. Search on Bibsonomy INTERACT (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Design, Interaction, Human factors, Experimentation, Displays, Embodied interaction, FogScreen
31Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot The Minimum Reload s-tPath/Trail/Walk Problems. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Venkat Chandrasekaran, Jason K. Johnson, Alan S. Willsky Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Chen Avin, Michal Koucký 0001, Zvi Lotker How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Injong Rhee, Minsu Shin, Seongik Hong, Kyunghan Lee, Song Chong On the Levy-Walk Nature of Human Mobility. Search on Bibsonomy INFOCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Terumasa Narukawa, Masaki Takahashi, Kazuo Yoshida Level-Ground Walk Based on Passive Dynamic Walking for a Biped Robot with Torso. Search on Bibsonomy ICRA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Jose H. Blanchet, Jingchen Liu Rare-event simulation for a multidimensional random walk with t distributed increments. Search on Bibsonomy WSC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Ming Zhong 0006, Kai Shen Random walk based node sampling in self-organizing networks. Search on Bibsonomy ACM SIGOPS Oper. Syst. Rev. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Kentaro Takahashi, M. Noda, Dragomir N. Nenchev, Yuichi Tsumaki, Akinori Sekiguchi Static Walk of a Humanoid Robot Based on the Singularity-Consistent Method. Search on Bibsonomy IROS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Yiming Zhang 0003, Xicheng Lu, Dongsheng Li 0001, Nong Xiao DRWT: An Efficient Random Walk Algorithm for Unstructured P2P Networks. Search on Bibsonomy ICDCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Hai Zhuge, Xue Chen, Xiaoping Sun Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks. Search on Bibsonomy WWW (Special interest tracks and posters) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF trust, search, probability, P2P, power-law
31Michael Alekhnovich, Eli Ben-Sasson Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
31Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman Exponential algorithmic speedup by a quantum walk. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF quantum algorithms, quantum walks
31Yaw-Ling Lin Minimum Back-Walk-Free Latency Problem. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
31Osamu Maruyama, Satoru Miyano Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
29Youming Qiao, Christophe Tartary Counting Method for Multi-party Computation over Non-abelian Groups. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Neighbor-Avoiding Walk, Random Walk, Graph Coloring, Multiparty Computation, Non-Abelian Groups, Passive Adversary
28Yasushi Endow On Stochastic Variation in Discrete Time Systems. Search on Bibsonomy EUROCAST The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Stochastic variation, Martingale representation, Random walk, Walsh functions
28Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy Estimating PageRank on graph streams. Search on Bibsonomy PODS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF graph conductance, random walk, PageRank, streaming algorithms, mixing time
28Akihiro Fujihara, Hiroyoshi Miwa Efficiency Analysis on an Information Sharing Process with Randomly Moving Mobile Sensors. Search on Bibsonomy SAINT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Delay- and Disruption-Tolerant Networking, Ad Hoc and Sensor Networks, Efficient Content Delivery, Random Walk, Stochastic Process, Power Law
28Xiaojun Wan 0001, Jianwu Yang Multi-document summarization using cluster-based link analysis. Search on Bibsonomy SIGIR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cluster-based link analysis, conditional Markov random walk model, multi-document summarization, HITS
28Norio Konno Quantum Walks and Quantum Cellular Automata. Search on Bibsonomy ACRI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF quantum cellular automaton, stochastic cellular automaton, quantum walk
28Xianfang Sun, Paul L. Rosin, Ralph R. Martin, Frank C. Langbein Random walks for mesh denoising. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2007 DBLP  DOI  BibTeX  RDF random walk, mesh smoothing, feature preservation, mesh denoising
28Stephen D. Miller, Ramarathnam Venkatesan Spectral Analysis of Pollard Rho Collisions. Search on Bibsonomy ANTS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Pollard Rho algorithm, collision time, random walk, spectral analysis, discrete logarithm, expander graph, mixing time
28Predrag R. Jelenkovic, Avishai Mandelbaum, Petar Momcilovic Heavy Traffic Limits for Queues with Many Deterministic Servers. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF GI/D/N, Quality and Efficiency Driven (QED) or Halfin-Whitt regime, telephone call or contact centers, Gaussian random walk, Spitzer''s identities, heavy-traffic, economies of scale, multi-server queue, deterministic service time
28Matthew Pirretti, Greg M. Link, Richard R. Brooks, Narayanan Vijaykrishnan, Mahmut T. Kandemir, Mary Jane Irwin Fault Tolerant Algorithms for Network-On-Chip Interconnect. Search on Bibsonomy ISVLSI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Fault Tolerance, Network on Chip, Random Walk, Flooding
28Michael Kozuch, Wayne H. Wolf, Andrew Wolfe An Experimental Analysis of Digital Video Library Servers. Search on Bibsonomy Multim. Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Non-linear video, Video walk-through, Performance analysis, Video server, Video library
28J. W. Cohen On the asymmetric clocked buffered switch. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF nearest-neighbour random walk, two-dimensional meromorphic functions, analytic continuation, two-server queueing model
Displaying result #1 - #100 of 4738 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license