
	Where results make sense

Topic: Algorithmic topology

	The algorithmic journey to harmonic resolution... (Site not responding. Last check: 2007-10-08)
		The prilling algorithm revealed that the most natural topology for dynamic change was one that, while having a defined number of elements, had neither bounds nor borders.
		Through algorithmic exploration, it was found that the "seeds" for the function needed to address the next layer were present within the phase difference between the scalars of the current layer's function.
		An algorithmic "clock" was created using the diesis, and, upon introducing this clock to the analog processor, the environment literally "came to life".
	www.greatdiesis.com /archive/hrjourney.html (2587 words)

	Home Page
		Topology is "rubber geometry," technically, the mathematics of bicontinuous one-to-one transformations of a set of points comprising a so-called space.
		This is where algebraic topology comes in, in the form of simplicial topology and fibrations.
		It provides an algorithmic expression of Riegel's dialectical psychology, and since $ is the "sum" function for the chain mappings in the category of simplicial sets, it also describes the connectionism involved in information processing psychology.
	home.att.net /~topologicalpsychology/index.htm (1169 words)

	IPS - Algorithmic Topology and Classification of 3-Manifolds (Site not responding. Last check: 2007-10-08)
		This self-contained book by a leading topologist is devoted to algorithmic low-dimensional topology, a branch of mathematics that has recently been undergoing an intense development.
		The subject of the book is the topology of bare 3-manifolds, without geometric structures, which became incorporated into 3-dimensional topology by the work of Thurston.
		Algorithmic recognition of the 3-sphere 5.1 Thin position of links 5.2 Almost normal surfaces and the Rubinstein theorem 5.3 The algorithm 6.
	www.ips.com.pl /cgi-bin/opisy.cgi?3540441719&T (429 words)

	Jeff Erickson's Publications by Subject
		Computational topology is a rapidly maturing research area at the intersection of mathematics and computer science, focused on the development of efficient algorithms for topological problems arising either directly from topology, from theoretical computer science, or from other areas of computing.
		Algorithmic techniques have been ubiquitous in topology since its inception a century ago, but the efficiency of topological algorithms and their applicability to other computing domains are relatively recent areas of study.
		Algorithms are traditionally designed and analyzed for efficiency only in the worst case, but worst-case inputs for many problems are often highly contrived.
	compgeom.cs.uiuc.edu /~jeffe/pubs/category.html (1060 words)

	"topology" - Shopping.com
		Robert Gilmore et al - The Topology of Chaos: Alice in Stretch and Squeezeland
		Analysis, Geometry And Topology of Elliptic Operators: Papers in Honer of Krysztof P
		Homotopy Methods in Algebraic Topology: Proceeding of an Ams-Ims-Siam Joint Summer Research Conference Held at University of Colorado, Boulder, Colorado, June 20-24, 1999
	www.shopping.com /xCC-topology--price_range_60_100 (513 words)

	Algorithmic C Synthesis Fuels Functional Reuse
		C/C++ is the language of choice for most algorithm designers because it is not over constrained by the timing and structural constraints inherent in other high-level description languages, allowing for faster simulation and verification.
		With algorithmic synthesis based on pure ANSI C/C++, it is possible to develop functional IP in the form of C algorithms and synthesize process-specific and optimized RTL code.
		Relying on algorithmic synthesis, each design team could rapidly examine and find an optimal structure to meet their specific performance goals.
	www.fpgajournal.com /articles_2005/20050809_mentor.htm (1838 words)

	Research - UNL - Department of Mathematics (Site not responding. Last check: 2007-10-08)
		The interplay between topology, group theory, and semigroup theory has yielded a wealth of information in all three mathematical fields.
		Mark Brittenham works in low-dimensional topology, a subject that focuses on spaces that have small dimension, such as surfaces, and knots (and their complements) in 3-space.
		Some of his particular interests are in the theory of inverse semigroups (essentially semigroups of partial symmetries of mathematical objects) and in the study of algorithmic problems in semigroup theory and infinite group theory.
	www.math.unl.edu /pi/research/gst (249 words)

	Wolfgang Haken - Wikipedia, the free encyclopedia
		Wolfgang Haken (born June 21, 1928) is a mathematician who specializes in topology, in particular 3-manifolds.
		Much of his work has an algorithmic aspect, and he is one of the influential figures in algorithmic topology.
		One of his key contributions to this field is an algorithm to detect if a knot is unknotted.
	en.wikipedia.org /wiki/Wolfgang_Haken (174 words)

	The Network Simulator ns-2 : Tips and Statistical Data for Running Large Simulations in NS
		Algorithmic routing is a mechanism by which a simple algorithm is used to compute the next hop for any source and destination pair within a given topology.
		However, even though algorithmic routing reduces memory requirement, the routes computed maynot always be the shortest or the most optimum.
		For more on algorithmic routing see Polly Huang and John Heidemann's paper on Minimizing Routing State for Light-Weight Network Simulation, In Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, p.
	www.isi.edu /nsnam/ns/ns-largesim.html (1944 words)

	Simple Index Keyword Search of Unified Computer Science TR Index
		These include techniques which are dependent on network topology or algorithmic structure, such as graph embedding and the method of compress and iterate as well as techniques with less specific application such as the employment of hashing and the use of parallel slackness to hide network latency.
		One is to simulate the new Arpanet routing algorithm [MCQ 80] and its extension to hierarchical networks [TSA 82, RAM 83], and the other one for the original Arpanet routing algorithm [MCQ 74] and its extension to hierarchical networks [MCQ 74, KAM 76, HER 82].
		Algorithms we develop use those heuristics to calculate paths that are merged into a tree.
	www.mat.uc.pt /~rps/papers/routing.html (6472 words)

	Saugata Basu (Site not responding. Last check: 2007-10-08)
		Efficient Algorithms for Computing the Betti Numbers of Semi-algebraic Sets, Colloquium, Department of Mathematics, University of Illinois, Urbana-Champaign, Sept 16, 2004.
		Polynomial time algorithm for computing certain Betti numbers of the projections of semi-algebraic sets defined by few quadratic inequalities, (with T. Zell), to appear in Discrete and Computational Geometry.
		A New Algorithm to find a point in every cell defined by a family of polynomials (with R. Pollack and M.-F. Roy), in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson Eds., Springer-Verlag.
	www.math.gatech.edu /~saugata (1279 words)

	Computational Topology at WSU (Site not responding. Last check: 2007-10-08)
		The 1990's has seen the development of a new research area called Computational Topology, an area of study distinct from the related field of computational geometry.
		According to a recent survey paper on the subject, computational topology's agenda "includes the identification and formalization of topological questions in computer applications and the study of algorithms for topological problems" (Ref.
		Topology itself is a well-developed area of mathematics and it offers many challenges for algorithmic studies.
	www.eecs.wsu.edu /~axen/alpha (125 words)

	BioGeometry Education
		The course is intended to provide a systematic introduction to the modeling and algorithmic techniques behind the geometric and statistical analysis of 3D shapes that arise in many applications including molecular biology, computer graphics, and computer aided design.
		It is a course about exciting new algorithms that are motivated by the challenges we face in modeling macromolecules and predicting their properties in silico.
		The primary goal of the course is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology.
	biogeometry.duke.edu /education (1486 words)

	Acquisitions in Mathematics 2003, page 4 (513-514.9) - Mathematics - LEARN - The University of Auckland Library
		Topology and geometry: commemorating SISTAG: Singapore International Symposium in Topology and Geometry, (SISTAG) July 2-6, 2001, National University of Singapore, Singapore / A.J. Berrick, Man Chun Leung, Xingwang Xu, editors.
		Algorithmic topology and classification of 3-manifolds / Sergei Matveev.
		Contents: Gusein-Zade, On the topology of quasiperiodic functions, pp1-7, 2001k:58087 and 0959.58048; Kontsevich and Suhov, Statistics of Klein polyhedra and multidimensional continued fractions, pp9-27, 2001h:11101 and 0945.11012; Pajitnov, C
	www.library.auckland.ac.nz /subjects/math/older/2003p4.htm (1026 words)

	Jon Kleinberg's Homepage
		My research is centered around algorithmic issues at the interface of networks and information, with an emphasis on the social and information networks that underpin the Web and other on-line media.
		An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs.
		Decision algorithms for unsplittable flow and the half-disjoint paths problem.
	www.cs.cornell.edu /home/kleinber (1318 words)

	buch.de - bücher - versandkostenfrei - Algorithmic Topology and Classification of 3-Manifolds. Algorithms and ...
		buch.de - bücher - versandkostenfrei - Algorithmic Topology and Classification of 3-Manifolds.
		This book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers.
		TOC:Simple and special polyhedra.- Complexity theory of 3-manifolds.- Haken theory of normal surfaces.- Applications of the theory of normal surfaces.- Algorithmic recognition of S3.- Classification of Haken 3-manifolds.- Computer implementation.- The Turaev-Viro invariants.- Appendix.
	www.buch.de /buch/03851/608_algorithmic_topology_and_classification_of_3_manifolds__algorithms_and_computation_in_mathematics__band_9.html (382 words)

	CS684
		Algorithmic Game Theory combines algorithmic thinking with game-theoretic, or, more generally, economic concepts.
		The most defining characteristic of the Internet is that it was not designed by a single central entity, but emerged from the complex interaction of many economic agents, such as network operators, service providers, designers, users, etc., in varying degrees of collaboration and competition.
		The course pre-requisites is background in algorithms and graphs at the level of CS 482.
	www.cs.cornell.edu /courses/cs684/2005fa (1401 words)

	Amin Saberi
		Cell Breathing in Wireless LANs: Algorithms and Evaluation, to appear in IEEE Transactions on Mobile Computing, 2007.
		On the Semantics of Internet Topology, Technical Report GIT-CC-02-07, Abstract in Dimacs Workshop on Internet and WWW Measurement, Mapping and Modeling 2002, and IPAM Workshop on Large Scale Communication Networks.
		Adwords: an algorithmic perspective, OR seminar (Stanford), Microsoft Research (Redmond), IBM research at Watson, Google, INFORMS 06.
	www.stanford.edu /~saberi (625 words)

	Distributed Systems
		Selected papers and other material from the literature will be posted on the web or distributed in class.
		Algorithm analysis and design, Operating systems; or permission of the instructor.
		Week 2.2: Global states; Chandy-Lamport algorithm; read this survey.
	www.cs.uic.edu /~ajayk/c553fa03.html (1017 words)

	Rui's Research (Site not responding. Last check: 2007-10-08)
		My research focuses on developing efficient algorithms and techniques for optimization problems with emphasis on those problems arising in network and distributed system design, such as scheduling, routing, clustering, protocol design, and schemes for network configuration.
		My current work focuses on the topology control problems that are concerned with the assignment of transmission powers to the transceivers of an ad hoc network so that the power assignment leads to a topology satisfying some specified properties, such as small diameter and high connectivity.
		Since the energy consumption of a transceiver is significantly affected by its transmission power, reducing the power at each transceiver can prolong the lifetime of an ad hoc network.
	www.eecis.udel.edu /~ruliu/research.html (360 words)

	NSF Program Announcement/Solicitation: COMPUTATIONAL and ALGORITHMIC REPRESENTATIONS of GEOMETRIC OBJECTS
		Many of the extensions sought impinge upon the newly emerging area of computational topology, in which foundational research has begun separately within the topology, computational geometry, computer graphics, and other communities of mathematical and computational science researchers.
		So far, algorithms are typically specific to certain data representations and underlying topological questions common to all the approaches have not received adequate attention.
		This solicitation aims both to replace currently isolated research niches in computational topology with a cohesive research community, to harness the potential of this area of research in a wide spectrum of applications, and to impact the research community by enlarging the pool of principal investigators.
	www.nsf.gov /pubs/2001/nsf01111/nsf01111.htm (4175 words)

	PriceLeap.com Sitemap
		Algorithmic Topology and Classification of 3-Manifolds (Algorithms and Computation in Mathematics Series #9)
		Introduction to Topology and Modern Geometry (Pure and Applied Mathematics Series)
		Topology and Geometry of Manifolds: 2001 Georgia International Topology Conference, May 21-June 2, 2001, University of Georgia, Athens, Georgia
	www.priceleap.com /sitemap/Topology--521000 (311 words)

	BookHq: Compare New & Used Books and College Textbooks Prices
		0387089209 : Algebraic and Geometric Topology: Proceedings of a Symposium Held at Santa Barbara in Honor of Raymond L. Wilder, July 25-29, 1977
		0387129022 : Algebraic Topology, Aarhus 1982:Proceedings of a Conference Held in Aarhus, August 1-7, 1982
		0387954503 : Algebric Topology from a Homotopical Viewpoint
	www.bookhq.com /history/a_14700.html (553 words)

	topology
		John W. Milnor - Topology from the Differentiable Viewpoint
		Edward R. Fadell et al - Geometry and Topology of Configuration Spaces
		Graham Flegg et al - From Geometry to Topology
	www.shopping.com /xCC-topology--media_geometry_general (382 words)

	2004 Morocco (Site not responding. Last check: 2007-10-08)
		The aim of this course is to provide participants with an introduction to and an overview to differential topology, differential geometry and computational geometry.
		Moreover, this School will give the opportunity to each participant to give a talk on his own research activities or project of research related to scientific topics connected to geometry and topology.
		candidates), post-doctoral students, professors and others who wish to enrich their mathematical background and are interested by an introduction into fields involving differential geometry and topology, and computational geometry.
	www.cimpa-icpam.org /Anglais/AnciensProg-a/2004/Morocco04.html (256 words)

	Inderscience Publishers Ltd. (Site not responding. Last check: 2007-10-08)
		Theoretical and algorithmic approaches that address key issues in sensor networks have been playing a central role in these networks flourishing.
		Common theoretical and algorithmic issues in sensor networks include location management, topology control and coverage, security and privacy, scalable design, cross layer design, energy efficient message dissemination, QoS, to just name a few.
		The goal of the special issue is to publish the most recent results in the development of theoretical and algorithmic aspects of sensor networks.
	www.inderscience.com /browse/callpaper.php?callID=315 (385 words)

	Algorithmic diversions
		Geometric algorithms `in action', the geometry junkyard (Epstein).
		Introduction to graphs and algorithms (Emden-Weinert et al).
		Course on algorithms in the real world (Blelloch).
	www.cs.uu.nl /groups/AD/indexA.html (167 words)

	Algorithmic Security Inc. - FA for Access Lists
		Learn how FA helped manage their large number of firewall change requests.
		You can customize risk levels per individual router or a group of routers; you can customize network topology; you can guide FA to treat trusted external IP addresses as non-threatening.
		Register here to view sample reports (PIX, Check Point, Juniper Netscreen, IOS ACL, Group analysis), evaluation download, pricing model, documentation and more.
	www.algosec.com /Products/AccessListAnalyzer (562 words)

	Preprints
		On the contact topology and geometry of ideal fluids,
		Contact topology and hydrodynamics I: Beltrami fields and the Seifert Conjecture
		(revised 9/99), in Topology and its Applications 124 (2002), no. 2, 211--219.
	www.math.uiuc.edu /~ghrist/preprints/index.html (437 words)

	Seminar for Women in Mathematics
		Abstract: Computational topology is a relatively new area in the intersection of
		methods in topology with algorithmic questions motivated by
		I will provide a survey of some algorithmic
	www.math.uiuc.edu /~carlisle/WomensSeminar.html (569 words)

Try your search on: Qwika (all wikis)