The past decade has seen a convergence of social and technological networks, with systems such as the World Wide Web characterized by the interplay between rich information content, the millions of individuals and organizations who create it, and the technology that supports it. This course covers recent research on the structure and analysis of such networks, and on models that abstract their basic properties. Topics include combinatorial and probabilistic techniques for link analysis, centralized and decentralized search algorithms, network models based on random graphs, and connections with work in the social sciences.
Evolutionary Algorithms Parameter Tuning to Solve the Root Identification Problem in Geometric Constraint Solving: A case of study with PBIL and CHC Algorithms
A rope is a high performance replacement for Strings. The datastructure, described in detail in "Ropes: an Alternative to Strings", provides asymptotically better performance than both String and StringBuffer for common string modifications like prepend, append, delete, and insert. Like Strings, ropes are immutable and therefore well-suited for use in multi-threaded programming.
Open source tools have recently reached a level of maturity which makes them suitable for building large-scale real-world systems. At the same time, the field of machine learning has developed a large body of powerful learning algorithms for a wide[...]
This project contains Naive and Fishers bayesian classifiers, as described in Toby Segaran's book "Programming Collective Intelligence." The book has python implementations; this is a Java implementation.
ConceptNet is a freely available commonsense knowledgebase and natural-language-processing toolkit which supports many practical textual-reasoning tasks over real-world documents right out-of-the-box (without additional statistical training) including
The process of writing large parallel programs is complicated by the need to specify both the parallel behaviour of the program and the algorithm that is to be used to compute its result.
Want to write shorter, cleaner code? Have an unfortunate situation where you need to fit as much as you can in one expression? Prefer a quick dose of hacks to spending the rest of your life reading the docs? You've come to the right place.
This library provides Python functions for agglomerative clustering. Its features include * generating hierarchical clusters from distance matrices * computing distance matrices from observation vectors * computing statistics on clusters *
SciPy (pronounced "Sigh Pie") is open-source software for mathematics, science, and engineering. It is also the name of a very popular conference on scientific programming with Python. The SciPy library depends on NumPy, which provides convenient and fast
To even try to keep pace with the rapid evolution of game development, you need a strong foundation in core programming techniques-not a hefty volume on one narrow topic or one that devotes itself to API-specific implementations. Finally, there's a guid
You've built a vibrant community of Family Guy enthusiasts. The SVD recommendation algorithm took your site to the next level by allowing you to leverage the implicit knowledge of your community. But now you're ready for the next iteration - you are about
The Mobile Robot Programming Toolkit (MRPT) is an extensive, cross-platform, and open source C++ library aimed to help robotics researchers to design and implement algorithms (mainly) in the fields of Simultaneous Localization and Mapping (SLAM), computer
Get the entire book! Introduction to Neural Networks with Java Programming Neural Networks in Java will show the intermediate to advanced Java programmer how to create neural networks. This book attempts to teach neural network programming through two mec
A red-black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them "symmetric binary B-tre
A red-black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them "symmetric binary B-tre
Libtextcat is a library with functions that implement the classification technique described in Cavnar & Trenkle, "N-Gram-Based Text Categorization" [1]. It was primarily developed for language guessing, a task on which it is known to perform with near-pe
The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.
We have seen that as a system gets congested, the service delay in the system increases. A good understanding of the relationship between congestion and delay is essential for designing effective congestion control algorithms. Queuing Theory provides all
DCOPolis was originally developed to provide a testbed for comparing Distributed Constraint Optimization (DCOP) algorithms in a sterile environment. It was the authors' opinion (along with many in the DCOP community) that existing metrics for comparing solution techniques did not adequately capture the many intricacies inherent in such a problem. A byproduct of this testbed is a framework in which a single representation of a DCOP problem can be solved by a multitude of different solution algorithms, either in simulation or deployed on a live (possibly ad-hoc) network.
The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design.
Google’s net profit margin last year was 29 percent. Amazon’s was 1.8 percent. Should it pay attention to ventures like Mahalo, the new humanly-edited search engine? Should we, as searchers, pay attention? Why?
Edsger Wybe Dijkstra was one of the most influential members of computing science's founding generation. Among the domains in which his scientific contributions are fundamental are
The Rete Algorithm [References] is intended to improve the speed of forward-chained rule systems by limiting the effort required to recompute the conflict set after a rule is fired. Its drawback is that it has high memory space requirements. It takes adva
Search algorithms & popularity factors: link, social, click, blog, industry. Since modern search engines are concerned with popularity and not direct relevancy, & big firms up the price of text link buying beyond affordability...
When users vote a website, that site is re-ranked for all users. This is the purest way to socialize search. The users can determine the best sites, actually better than computers or algorithms. This is the heart and soul of the sproose search engine.
TANAGRA is a free DATA MINING software for academic and research purposes. It proposes several data mining methods from exploratory data analysis, statistical learning, machine learning and databases area.
D. Kempe, J. Kleinberg, и \. Tardos. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, стр. 137–146. New York, NY, USA, Association for Computing Machinery, (2003)
S. Dughmi. (2009)cite arxiv:0912.0322Comment: This revision corrects an error in definition 2.2, as well as provides additional intuition regarding the definitions of convex closure and concave closure.
E. Alotaibi. Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, стр. 158–160. Richland, SC, International Foundation for Autonomous Agents and Multiagent Systems, (2019)
M. A.Y.Abdelaziz. Emerging Trends in Electrical, Electronics & Instrumentation Engineering: An international Journal (EEIEJ), 1 (1):
01-17(февраля 2014)
J. Aspnes, K. Chang, и A. Yampolskiy. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, стр. 43–52. USA, Society for Industrial and Applied Mathematics, (2005)
X. He, и D. Kempe. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, стр. 885–894. New York, NY, USA, Association for Computing Machinery, (2016)
R. Binns, M. Van Kleek, M. Veale, U. Lyngs, J. Zhao, и N. Shadbolt. (2018)cite arxiv:1801.10408Comment: 14 pages, 3 figures, ACM Conference on Human Factors in Computing Systems (CHI'18), April 21--26, Montreal, Canada.
J. Lacki, и P. Sankowski. Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, стр. 257--268. New York, NY, USA, ACM, (2013)
P. Levis, N. Patel, D. Culler, и S. Shenker. Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation - Volume 1, стр. 2. Berkeley, CA, USA, USENIX Association, (2004)
Y. Busnel, M. Bertier, E. Fleury, и A. Kermarrec. Autonomics '07: Proceedings of the 1st international conference on Autonomic computing and communication systems, стр. 1--5. ICST, Brussels, Belgium, Belgium, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), (2007)
E. Ucan, N. Thompson, и I. Gupta. MidSens '07: Proceedings of the 2nd international workshop on Middleware for sensor networks, стр. 19--24. New York, NY, USA, ACM, (2007)
M. McGlohon, S. Bay, M. Anderle, D. Steier, и C. Faloutsos. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, стр. 1265--1274. New York, NY, USA, ACM, (2009)