Curse Buster Sound DirectoryYou are here » Curse Buster Sound » Links Directory » Kids and Teens » Computers (0)
Computers RSS FeedsCombinatorial Optimization on Graphs of Bounded Treewidth - There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input graph has bounded treewidth. For combinatorial optimization problems, this is a useful approach for obtaining fixed-parameter tractable algorithms. Starting from trees and series-parallel graphs, we introduce the concepts of treewidth and tree decompositions, and illustrate the technique with the Weighted Independent Set problem as an example. The paper surveys some of the latest developments, putting an emphasis on applicability, on algorithms that exploit tree decompositions, and on algorithms that determine or approximate treewidth and find tree decompositions with optimal or close to optimal treewidth. Directions for further research and suggestions for further reading are also given. ...Feed Source: comjnl.oxfordjournals.org Parameterized Complexity and Biopolymer Sequence Comparison -
The paper surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest common supersequence, pairwise sequence alignment, multiple sequencing alignment, structure–sequence alignment and structure–structure alignment. Algorithm techniques, built on the structural-unit level as well as on the residue level, are discussed.
... The Bidimensionality Theory and Its Algorithmic Applications -
This paper surveys the theory of bidimensionality. This theory characterizes a broad range of graph problems (‘bidimensional’) that admit efficient approximate or fixed-parameter solutions in a broad range of graphs. These graph classes include planar graphs, map graphs, bounded-genus graphs and graphs excluding any fixed minor. In particular, bidimensionality theory builds on the Graph Minor Theory of Robertson and Seymour by extending the mathematical results and building new algorithmic tools. Here, we summarize the known combinatorial and algorithmic results of bidimensionality theory with the high-level ideas involved in their proof; we describe the previous work on which the theory is based and/or extends; and we mention several remaining open problems.
... Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems -
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the computation of cores in data exchange.
... Width Parameters Beyond Tree-width and their Applications -
Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ‘width’ parameters in combinatorial structures delivers—besides traditional tree-width and derived dynamic programming schemes—also a number of other useful parameters like branch-width, rank-width (clique-width) or hypertree-width. In this contribution, we demonstrate how ‘width’ parameters of graphs and generalized structures (such as matroids or hypergraphs), can be used to improve the design of... Some Parameterized Problems On Digraphs -
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problems and directed k-leaf problems. We also prove some new results on the topic. Most of these new results are on parameterizations of the backward paired comparison problem.
... Parameterized Complexity of Geometric Problems -
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research.
... Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities -
In cognitive science, natural cognitive processes are generally conceptualized as computational processes: they serve to transform sensory and mental inputs into mental and action outputs. At the highest level of abstraction, computational models of cognitive processes aim at specifying the computational problem computed by the process under study. Because computational problems are realistic cognitive models only insofar as they can plausibly be computed by the human brain given its limited resources for computation, computational tractability provides a useful constraint on cognitive models. In this paper, we consider the particular benefits of the parameterized complexity framework for identifying sources of intractability in cognitive models. We review existing applications of the parameterized framework to this end in the domains of perception, action and higher cognition. We further identify important opportunities and challenges for future research. These include the develop... Worldstart Computer Tips and Techniques 05-16-2008 - 05-16-2008 - Critical Updates Explained + Can You Burn? + EZ RSS Feeds + Fr... Worldstart Computer Tips and Techniques 05-15-2008 - 05-15-2008 - Must Have All-In-1 Messenger + Know Your Space Limits + A Case... Worldstart Computer Tips and Techniques 05-14-2008 - 05-14-2008 - More XP SP3 Support + Recover the Recycle Bin + Handy Performa... Worldstart Computer Tips and Techniques 05-13-2008 - 05-13-2008 - XP SP3 Install Help + Create A Custom Keyboard + Blurry Photos... Worldstart Computer Tips and Techniques 05-12-2008 - 05-12-2008 - Critical XP Update SP3 + Great New XP Features + EZ Hotspot Co... Worldstart Computer Tips and Techniques 05-09-2008 - 05-09-2008 - Be Safe - Scan Attachments! + Avoid Common E-mail Mistakes + F... Worldstart Computer Tips and Techniques 05-08-2008 - 05-08-2008 - Awesome Virtual PC Download +Cool Preview Gadget + Delete Unwa... Worldstart Computer Tips and Techniques 05-07-2008 - 05-07-2008 - Powerful Computer Protection For You + New XP SP3 News + EZ Fi... Worldstart Computer Tips and Techniques 05-06-2008 - 05-06-2008 - Protect Your Keyboard + Computer Lingo Decoded + F2 Magic + Fi... Worldstart Computer Tips and Techniques 05-05-2008 - 05-05-2008 - Get A Better Burn + Great Resources for Seniors! + Fractions A... Worldstart Computer Tips and Techniques 05-02-2008 - 05-02-2008 - Find Missing Hardware + Watch A Webisode! + Friday Funnies
... Worldstart Computer Tips and Techniques 05-01-2008 - 05-01-2008 - Vista SP1 Alert + Control Your Computer! + Fix Audio Problems
... Worldstart Computer Tips and Techniques 04-30-2008 - 04-30-2008 - Protect E-mail from Junk + Advanced Firewall Protection + Flas... Worldstart Computer Tips and Techniques 04-29-2008 - 04-29-2008 - Are You An Energy Fiend?+ Fun With Linky + Low Light Photo Tip... DNA Profiles Link Dope to Its Source - 09 Jul 03
Forensic scientists in the U.S. are applying DNA fingerprinting methods to the cannabis plant. They say the technique, which is being used to create a database of DNA profiles of different marijuana plants, will help them to trace the source of any sample.
'It links everybody together: the user, the distributor, the grower,' says the database's creator, Heather Miller Coyle of the Connecticut State Forensic Science Laboratory in Meriden. 'That's the real intent of it, to show it's not just one guy with a little bag of marijuana, but it's a group of people.'
A method for spotting the tiniest traces of marijuana, based on detecting DNA unique to cannabis chloroplasts, has already been developed in the UK (New Scientist print edition, 07 Aug 1999). B... Mathematics: Does the Proof Stack Up? - by George Szpiro
03 Jul 03
Just under five years ago, Thomas Hales made a startling claim. In an e-mail he sent to dozens of mathematicians, Hales declared that he had used a series of computers to prove an idea that has evaded certain confirmation for 400 years. The subject of his message was Kepler's conjecture, proposed by the German astronomer Johannes Kepler, which states that the densest arrangement of spheres is one in which they are stacked in a pyramid - much the same way as grocers arrange oranges.
Soon after Hales made his announcement, reports of the breakthrough appeared on the front pages of newspapers around the world. But today, Hales's proof remains in limbo. It has been submitted to the prestigious Annals of Mathematics, but... Scientists Discover Planetary System Similar to Our Own -
The image shows an impression by David A. Hardy of a possible scene from a moon orbiting the extra-solar planet in orbit around the star HD70642. Photo Credit: David A. Hardy.
... Hacker How-To Good Summer Reading - by Michelle Delio
27 Jun 03
Stealing the Network: How to Own the Boxby Ryan RussellSyngress, 330 pp., $49.95
Stealing The Network: How to Own the Box, a compendium of tales written by well-known hackers, is a perfect summer read. The stories are fictional. The technology and techniques described are very real.
A warning: Those... Copyright © 2008, Curse Buster Sound. All Rights Reserved. |