Sciweavers

1186 search results - page 37 / 238
» Improving Random Walk Performance
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
13 years 11 months ago
Complementarity of Error Detection Techniques
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
Radek Pelánek, Václav Rosecký...
EMNLP
2006
14 years 11 days ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran
SIGIR
2006
ACM
14 years 5 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
CEC
2008
IEEE
14 years 5 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
COMAD
2009
14 years 2 days ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan