
	Where results make sense

Topic: Theory of algorithms

Related Topics

Canadian computing competition

LDraw

SCD

Luverne, Alabama

George Colley

Alferd Packer

Arkham House

LSA

Oxfam

	Algorithms and Theory Group @ University of Maryland
		Approximation algorithms is the branch of algorithms dealing with the design of polynomial time algorithms that produce solutions that are close to optimal.
		One topic of research in complexity theory at The University of Maryland is looking at analogs of P=?NP in communication complexity and descriptive complexity theory and seeing if the problem is solvable there, and what insights it may offer for the real problem.
		Randomized algorithms are algorithms that make random choices as they proceed, and have had a fundamental impact on many areas of computer science including distributed computing, cryptology, and networking.
	www.cs.umd.edu /areas/Theory (951 words)

	Theory and Algorithms Research
		theory group at Microsoft Research is an invaluable resource -- on top of research collaborations, we benefit from their innumerable seminars and the advanced theory courses their members often offer at UW.
		Error-Correcting Codes The focus of this research is on constructions of error-correcting codes and efficient algorithms for decoding them in the presence of large amounts of noise, as well as exploring connections of codes to complexity theory and cryptography.
		Algorithms for Media-on-Demand In this project we investigate the ability of stream merging to help solve the bandwidth problems for multimedia.
	www.cs.washington.edu /research/computation (627 words)

	Theory Group (Site not responding. Last check: 2007-10-08)
		The theory group brings together researchers in many areas of mathematics and physics to develop novel approaches to problems in computer science and information technology.
		Among the areas of expertise we have are statistical physics, probability theory, combinatorics, geometry and topology, theoretical computer science, and algorithms.
		The analysis of algorithms involving probability (either through a random input or an internal random number generation) is a difficult question, which requires the most advanced techniques from discrete probability.
	research.microsoft.com /theory (462 words)

	Number theory algorithms (Site not responding. Last check: 2007-10-08)
		The main algorithm for the calculation of the GCD of two integers is the binary Euclidean algorithm.
		The Miller-Rabin algorithm improves on this by using the property that for prime n there are no nontrivial square roots of unity in the ring of integers modulo n (this is Lagrange's theorem).
		The efficiency of this algorithm is determined by the size of the smallest factor p of n.
	yacas.sourceforge.net /Algochapter2.html (3917 words)

	COS 423, Spring 2002: Home Page
		This course is designed to provide students with an understanding of the principles and techniques used in the design and analysis of computer algorithms.
		The course is primarily theoretical and does not require programming, but it does require understanding of the notion of a mathematical proof and some knowledge of elementary discrete mathematics.
		We will discuss and analyze a variety of data structures and algorithms chosen for their importance and their illustration of fundamental concepts.
	www.cs.princeton.edu /courses/archive/spring02/cs423 (560 words)

	UC Davis - Computer Science - Algorithms and Theory Laboratory
		Algorithms and theory covers a huge range of topics: classical complexity-theoretic and foundational questions; practical algorithms within specific problem domains; creating general-purpose tools and techniques; making abstract models that help one see into the heart of a problem.
		If there's an over-arching theme for our work, it is to develop and apply theory in a way that is interesting and useful; it is characteristic for the theory folks at UCD that our aesthetic sensibilities are informed by relevance (as well as by the math and wanting to have some fun).
		While work in algorithms and theory can often be done under a tree as well or better than in a physical laboratory, we do have a physical lab where many of our graduate students live.
	theory.cs.ucdavis.edu (439 words)

	MA314: Theory of Algorithms
		Algorithms are the methods by which a computer performs certain tasks.
		Algorithms and data structures for sorting and searching are treated in the beginning weeks of this course.
		Later parts of the course concern complexity theory, which is the study of the difficulty of computational problems.
	www.maths.lse.ac.uk /Courses/ma314.html (757 words)

	MIT // The Algorithms Group at CSAIL
		No prerequisites beyond basic efficient algorithms and Theory of Computation ---though some knowledge of Cryptography (e.g., 6.875) or Game Theory (e.g., 6.972 or 14.122) would be very useful.
		In this second course in algorithms, we will survey many of the techniques that apply broadly in the design of efficient algorithms, and study their application in a wide range of application domains and computational models.
		The prerequisites for this class are undergraduate courses in algorithms (e.g., 6.046) and discrete mathematics and probability (e.g., 6.042), in addition to mathematical maturity.
	theory.lcs.mit.edu /groups/algor/courses.htm (1498 words)

	Amazon.co.uk: Algorithmic Number Theory: Efficient Algorithms v. 1 (Foundations of Computing S.): Books (Site not responding. Last check: 2007-10-08)
		The subject of algorithmic number theory represents the marriage of number theory with the theory of computational complexity.
		The problems of algorithmic number theory are important both for their intrinsic mathematical interest and their application to random number generation, codes for reliable and secure information transmission, computer algebra and other areas.
		Together, the two volumes should cover the current state of the art in algorithmic number theory and should be useful to researchers and students with a special interest in theory of computation, number theory, algebra and cryptography.
	www.amazon.co.uk /exec/obidos/ASIN/0262024055 (537 words)

	Differential Galois theory and algorithms for linear ODE's. (Site not responding. Last check: 2007-10-08)
		Differential Galois theory and algorithms for linear ODE's.
		The asymptotic theory of singularities of complex differential equations by J.
		The Risch' algorithm involves the study of solutions of the Risch differential equation y'=ay+b over some differential field K, which are either in K or are algebraic over K.
	www-lmc.imag.fr /cathode2/Cirm2000/extended/Vanderput/Vanderput.html (2569 words)

	CMPE 177 - Classes - Baskin School of Engineering, UCSC
		Algorithms are explored to solve problems in connectivity, routing, matching, and embedding of graphs.
		Graph theory and algorithms are developed around applications in computer engineering.
		Its coverage of graph algorithms is weak and so the text is supplemented with handouts on graph algorithms.
	www.soe.ucsc.edu /classes/cmpe177 (533 words)

	Communication Theory: Cryptography: Algorithms (Site not responding. Last check: 2007-10-08)
		Cryptix Standard Cryptographic Algorithm Naming - Introduces a system to enumerate and give standard reference identifiers for cryptographic algorithms with sufficient detail that independent implementations will be able to interoperate.
		General Hash Function Algorithms - General hash function algorithm implementations for string hashing in the object pascal, c and c++ programming languages.
		SSH and Cryptographic Algorithms - A brief survey of some commonly used cryptographic algorithms.
	freshlinks.net /odp.aspx/Science/Math/Applications/Communication_Theory/Cryptography/Algorithms (337 words)

	Basic Theory &Fundamental Algorithms (Site not responding. Last check: 2007-10-08)
		The algorithms essentially work in the parameter space to construct the optimality regions, as an optimality region is a set of points in the parameter space.
		The algorithm when applied to the polygonal partitioning shown in figure 2.2 discovers vertices in the breadth first order as numbered in the figure.
		The algorithm tries to follow the curve being as close to it as possible and discover points where the curve moves from one optimality region to the other.
	www.cse.iitk.ac.in /research/mtech1997/9711124/all003.html (4775 words)

	Data Mining: Theory and Algorithms
		We present a sampling-based algorithm for approximate k-median clustering that improves upon previous approximation results in the case that the number of points n being clustered is the dominant problem parameter, assuming a distance metric on [0,M]^d.
		We also provide a generalization of the algorithm for use when no bound M is known for the points being clustered, and we describe how a previously developed dimension reduction technique can be applied to eliminate our dependence on the dimension when d > log n.
		We also develop a dynamic programming algorithm to evaluate the structural distance between two XML documents in time that is proportional to the document sizes.
	www.eecs.umich.edu /~jag/mining (1374 words)

	Approximation: Theory and Algorithms
		The resulting progress has uncovered fascinating connections to and among graph theory, the study of algorithms, and complexity theory.
		In these lecture we will show how various techniques and concepts which were introduced in previous lectures can be applied to design efficient approximation algorithms for various instances of the Steiner tree problem.
		In the first part of the lecture, we deal with the shifting strategy, which is a general technique for obtaining polynomial-time approximation schemes for Maximum Independent Set and other optimization problems on certain classes of graphs.
	www.ti.inf.ethz.ch /ew/courses/ApproxAlgs01/ApproxAlgs.html (705 words)

	Theory of Probability: Best introduction, formulae, software, algorithms
		In general, in the first case we apply the very first formula of probability theory (n/N) or the probability of the normal distribution (a more general and encompassing case than the first formula).
		The probability theory formula is also known as the probability of exactly M successes of K elements drawn in a pool of S favorable elements from a total of N elements.
		The master formula that calculates the number of trials N for an event of probability p to appear with a degree of certainty DC is known as the Fundamental Formula of Gambling.
	www.saliu.com /theory-of-probability.html (5114 words)

	Theory \| EECS at UC Berkeley (Site not responding. Last check: 2007-10-08)
		Today, the faculty, students, staff, visitors, and affiliated researchers of the Theory Group strive to continue this tradition through their research on the foundations of algorithms, complexity, and their applications to computer systems, as well as to other fields of science.
		Christos Papadimitriou is interested in the theory of algorithms and complexity, and its applications to databases, information retrieval, economics and game theory, and biology.
		Tom Henzinger is interested in the use of formal and algorithmic methods for the design of real-time and reactive systems.
	www.eecs.berkeley.edu /Research/Areas/CS/THY (709 words)

	COMMISSION III: Theory and Algorithms (Site not responding. Last check: 2007-10-08)
		Although a great deal of research focuses on object recognition and image understanding there is still a remarkable lack of theories and concepts.
		In building and road reconstruction more complex models are used, e.g., buildings are reconstructed in parts, or road detection algorithms are able to handle crossings or partially occluded areas.
		However, there is an increasing interest in the performance characteristics of algorithms from the computer vision community documented by various workshops and ECVNet benchmarking and performance evaluation activities.
	www.isprs.org /publications/annual_reports/report97/tc_3_rep.html (2455 words)

	Amazon.com: Curves and Surfaces in Geometric Modeling: Theory and Algorithms (The Morgan Kaufmann Series in Computer ... (Site not responding. Last check: 2007-10-08)
		Inside, the focus is on "blossoming"the process of converting a polynomial to its polar formas a natural, purely geometric explanation of the behavior of curves and surfaces.
		This insight is important for far more than its theoretical elegance, for the author proceeds to demonstrate the value of blossoming as a practical algorithmic tool for generating and manipulating curves and surfaces that meet many different criteria.
		The systematic use of blossoms (polar forms) is particularly elegant in the presentation of surfaces, where it clarifies greatly the differences between rectangular and triangular patches.
	www.amazon.com /exec/obidos/tg/detail/-/1558605991?v=glance (1648 words)

	UT Algorithms and Computational Theory Group
		Greg Plaxton (plaxton"at"cs.utexas.edu) --- Analysis of algorithms and theory of parallel computation.
		The algorithms mailing list is an electronic mailing list on which announcements related to seminars and activities in theoretical computer science in Austin and surrounding areas are posted.
		SIGACT sponsors the ACM Symposium on Theory of Computing (STOC) and is a co-sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA) and the ACM Symposium on Parallel Algorithms and Architectures (SPAA).
	www.cs.utexas.edu /users/vlr/sac.html (278 words)

	Oxford University Press: Evolutionary Algorithms in Theory and Practice: Thomas Bäck (Site not responding. Last check: 2007-10-08)
		This book presents a unified view of evolutionary algorithms: the exciting new probabilistic search tools inspired by biological models that have immense potential as practical problem-solvers in a wide variety of settings, academic, commercial, and industrial.
		The algorithms are presented within a unified framework, thereby clarifying the similarities and differences of these methods.
		As a detailed description of the algorithms, with practical guidelines for usage and implementation, this work will interest a wide range of researchers in computer science and engineering disciplines, as well as graduate students in these fields.
	www.oup.com /us/catalog/general/subject/ComputerScience/Algorithms/~~/cHI9MTAmcGY9MCZzcz1hdXRob3Imc2Y9ZmVhdHVyZWQmc2Q9YXNjJnZpZXc9dXNhJmNpPTAxOTUwOTk3MTA= (415 words)

	Learning Kernel Classifiers - The MIT Press
		This book provides the first comprehensive overview of both the theory and algorithms of kernel classifiers, including the most recent developments.
		Then follows a detailed introduction to learning theory, including VC and PAC-Bayesian theory, data-dependent structural risk minimization, and compression bounds.
		Throughout, the book emphasizes the interaction between theory and algorithms: how learning algorithms work and why.
	mitpress.mit.edu /026208306X (181 words)

	Wiley::Fundamentals of Wavelets: Theory, Algorithms, and Applications
		Wavelet theory originated from research activities in many areas of science and engineering.
		It balances a discussion of wavelet theory and algorithms with its far-ranging practical applications in signal processing, image processing, electromagnetic wave scattering, and boundary value problems.
		Fundamentals of Wavelets is an essential introduction to wavelet theory for students and professionals alike in a practical, real-world engineering context.
	www3.interscience.wiley.com:8100 /WileyCDA/WileyTitle/productCd-0471197483.html (256 words)

	TECHNICAL COMMISSION III: Theory and Algorithms
		Recent advances in modeling include scale-space theory, as well as multispectral data, although this is mostly restricted to color at the moment.
		The application of the scale-space theory for jointly describing the spectral and spatial behavior of a scene is still unsolved.
		The workshop on review of theory and algorithms for SAR was held in Cannes (France) on 28-30 January 1998.
	www.isprs.org /publications/annual_reports/report98/commissie_3.html (2755 words)

	UT Algorithms and Computational Theory Group
		The algorithms and computational theory (ACT) group focuses on the theoretical foundations of computer science.
		The current research interests of faculty in the group include algorithm design, complexity theory, parallel and distributed computation, graph theory, randomized computation, computational learning theory, probabilistic methods and combinatorics.
		A major focus of the group is on the design and analysis of provably efficient algorithms for solving fundamental computational problems, where efficiency can be measured in terms of different resources such as time, space, number of processors, and number of random bits.
	www.cs.utexas.edu /~act (378 words)

	Wiley::Graphs: Theory and Algorithms
		Theory of Discrete and Continuous Fourier Analysis (Hardcover)
		This adaptation of an earlier work by the authors is a graduate text and professional reference on the fundamentals of graph theory.
		It covers the theory of graphs, its applications to computer networks and the theory of graph algorithms.
	www.wiley.com /WileyCDA/WileyTitle/productCd-0471513563,descCd-description.html (156 words)

	HAL: heuristic algorithms for layout synthesis
		This paper describes graph theory based algorithms for layout synthesis of leaf cells.
		The algorithms can thus be used to form symbolic layouts for a general class of CMOS circuits, e.g., static dual type of circuitry or static CMOS circuitry with non-dual pullup and pulldown networks and dynamic logic styles (e.g., CPL, Domino, etc.).
		These algorithms are not only quite flexible in supporting various circuit styles, but are also run time efficient.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/arvlsi/1995/7047/00/7047toc.xml&DOI=10.1109/ARVLSI.1995.515620 (289 words)

	Formal Analysis, Theory and Algorithms Research Group (Site not responding. Last check: 2007-10-08)
		Our research involves the application of mathematics and logic to the design and analysis of algorithms and reliable, safe, and efficient hardware and software systems.
		The group is especially interested in bringing the clarity and insight of formal theories to hard application problems of real practical significance.
		We also develop new formal theories and tools to meet the challenges of these, and other, problem areas.
	www.dcs.gla.ac.uk /research/fata (199 words)

Try your search on: Qwika (all wikis)