61. FoIKS - Intro International Symposium on Foundations of Information and Knowledge Systems. Burg (Spreewald), Germany; 1417 February 2000. List of open problems. http://www.informatik.tu-cottbus.de/~foiks/

International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2000) next FoIKS will be held in february/march 2002

62. Open Problems Presented At SCG'98 open problems Presented at SCG'98. Problems presented at the openproblem sessionof the 14th Annual ACM Symposium on Computational Geometry are listed. http://www.cs.duke.edu/~pankaj/scg98-openprobs/open-probs.html

Open Problems Presented at SCG'98 Pankaj K. Agarwal Center for Geometric Computing, Dept. Computer Science, Duke University, Durham, NC 27708-0129, USA. Joseph O'Rourke Dept. of Computer Science, Smith College, Northampton, MA 01063, USA. Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed. Jack Snoeyink , University of British Columbia: Given a set P of points and a set S of disjoint line segments in the plane, does there always exist a spanning tree of P that, when embedded with straight edges, has the property that no segment in S is cut by more than two edges? If the weight of an edge of the spanning tree is the number of segments of S S Note that an affirmative answer for the first problem implies an affirmative answer for the second. While a few constructions give spanning trees with O S S S S induce a triangulation; in general, the application is to locate many points in a triangulation by walking along some ``nice'' path. Disjointness of segments is important; otherwise spanning trees with low stabbing number give upper and lower bounds of O S Vadim Shapiro , University of Wisconsin: Given two smooth real algebraic hypersurfaces S and S defined by polynomials of degree at most d that are tangent along the curve C (i.e., the locus of second order contact is the curve

63. Open Problems open problems. The field of Grammatical Inference enjoys the uncanny distinctionof being faced with a variety of open problems that remain to be solved. http://www.cs.iastate.edu/~honavar/gi/open.html

Open Problems The field of Grammatical Inference enjoys the uncanny distinction of being faced with a variety of open problems that remain to be solved. This page is provided to make researchers and practitioners aware of the different open problems and to motivate them to tackle these problems. It is impossible for us to catalog all the open problems in Grammatical Inference but this page is designed to allow people to contribute to the growing list. Polynomial Identification with Probability One Colin de la Higuera , November 6th, 1998 Several different algorithms have been proposed to learn Stochastic Deterministic Finite State Automata Absence of empirical data David G. Stork , February 1st, 1999 What problems in computational linguistics are primarily or entirely limited by lack of empirical data? That is, suppose we had a perfect oracle that could generate an extremely large number of samples (labelled sentences, spelling variants, etc., as appropriate) that could be used with existing inference or learning techniques. What problems would then be solved? I am especially interested in citable articles that give evidence for such a claim. I am compiling such a list of areas in a range of disciplines (optical character recognition, path planning, etc.) for a review article on the status of pattern recognition and machine intelligence.

64. Open Problems Column open problems Column. The open problems Column is run by Samir Khuller UMIACS3153 AV Williams Bldg. University of Maryland College Park, MD 20742. http://sigact.acm.org/sigactnews/volunteers/problems.html

Open Problems Column The Open Problems Column is run by Samir Khuller UMIACS 3153 AV Williams Bldg. University of Maryland College Park, MD 20742 Phone: (301) 405-6765 Email: samir@umiacs.umd.edu Created for SIGACT News by Ian Parberry , September 25, 1994. Last updated Tue Nov 7 15:21:07 CST 2000

65. FoIKS - Open Problems open problems. General overview 56 open problems, 23 solved by 16 MFDBSparticipants Modeling of reality in databases and knowledge bases. http://www.informatik.tu-cottbus.de/~foiks/open_prob/

International Symposium on Foundations of Information and Knowledge Systems (FoIKS) next FoIKS will be held in february/march 2002 FoIKS Entry open problems Open Problems General overview: 56 open problems, 23 solved by 16 MFDBS participants Modeling of reality in databases and knowledge bases. Logical foundations of database semantics. Representation of semantics and algebraic problems. Combinatorial problems. Query and update languages. Normalization theory. Admissible semantics. J. Biskup, J. van der Bussche, P. De Bra, J. Demetrovics, G. Gottlob, S. Hegner, A. Heuer, G. Katona, H. Nam Son, J. Paredaens, L. Tenenbaum B. Thalheim P 1. Find a common motivation, a common formal model and a correspondence that justify properties like normal forms, semantics preserving transformations, acyclicity, and formalize characteristics like complete representation, naturalness, minimality, system independence, flexibility, self-explanation, readability, P 2. Find a formalism which can be used to express structure, semantics and behavior of a database in an integrated manner. P 3.1.

66. Open Problems In Computer Virus Research Skip to main content open problems in Computer Virus Research. Conclusion.We have examined a few open problems in computer virus research. http://www.research.ibm.com/antivirus/SciPapers/White/Problems/Problems.html

Open Problems in Computer Virus Research Steve R. White IBM Thomas J. Watson Research Center Yorktown Heights, NY USA Presented at Virus Bulletin Conference, Munich, Germany, October 1998 Abstract Introduction Some people believe that there is no longer any interesting research to do in the field of protection from computer viruses - that all of the important technology has already been developed - that it is now a simple matter of programming to keep up with the problem. Others believe that "virus research" simply means "analyzing viruses." To dispel these misimpressions, we discuss several important research problems in the area, reviewing what is known on each problem and what remains open. The purpose of this paper is not to give solutions to these problems. Rather it is to outline the problems, to suggest approaches, and to encourage those interested in research in this field to pursue them. The problems we have selected have two characteristics. The first is that, if the problem were solved, it would significantly improve our ability to deal with the virus problem as it is likely to evolve in the near future. The second is that the problem constitutes an actual research problem, so that a definitive solution would be publishable in peer-reviewed computer science journals, and could form the basis for an M.S. thesis or, in some cases, a Ph.D. thesis. We discuss five problems: As more viruses are written for new platforms, new heuristic detection techniques must be developed and deployed. But we often have no way of knowing, in advance, the extent to which these techniques will have problems with false positives and false negatives. That is, we don't know how well they will work or how many problems they will cause. We show that analytic techniques can be developed which estimate these characteristics and suggest how these might be developed for several classes of heuristics.

67. Patrice Ossona De Mendez - Open Problems Complexity of computing indegree bounded orientations for planargraphs. Is there a linear time algorithm to solve the following http://www.ehess.fr/centres/cams/person/pom/openpb.html

Complexity of computing indegree bounded orientations for planar graphs Is there a linear time algorithm to solve the following problem: Input: A planar graph G=(V,E) and an integer valued function f on the vertex set of G. Output: An orientation of G such that the indegree of any vertex x is at most f(x), if such an orientation exists. Remark: If G is not assumed to be planar, the problem may be solved in O(mn) time. Representations by intersections of arcs or segments A family of nowhere tangent simple arcs or segments define an intersection multigraph where arcs correspond to vertices and each intersection of two arcs correspond an edge linking these arcs. It defines also an incidence hypergraph where intersection points correspond to vertices and arcs correspond to edges. Is any planar multigraph the intersection multigraph of a family of arcs? Is any simple planar graph the intersection graph of a family of segments? Is any planar hypergraph the incidence hyeprgraph of a family of arcs? Is any planar linear hypergraph the incidence hypergraph of a family of segments? (linear means that no two edges have more than one vertex in common) Reduced Genus The reduced genus of a multigraph is the minus genus of the vertex-edge incidence graph of a hypergraph having the same adjacencies with the same multiplicities.

68. Identifying Open Problems In Distributed Systems (ResearchIndex) Identifying open problems in Distributed Systems (Make Corrections) AndrewWarfield, Yvonne Coady, Norm Hutchinson Home/Search Context Related, http://citeseer.nj.nec.com/442270.html

Identifying Open Problems in Distributed Systems (Make Corrections) Andrew Warfield, Yvonne Coady, Norm Hutchinson Home/Search Context Related View or download: cs.unibo.it/ersads/paper warfield.pdf Cached: PS.gz PS PDF DjVu ... Help From: cs.unibo.it/ersads/program (more) Homepages: A.Warfield Y.Coady N.Hutchinson HPSearch ... (Update Links) Rate this article: (best) Comment on this article (Enter summary) Abstract: This paper is a summary of urgent problems that must be addressed in order for successful systems of this caliber to be realized. (Update) Active bibliography (related documents): More All Systems Directions for Pervasive Computing - Grimm, Davis, Hendrickson.. (2001) (Correct) ... (Correct) Similar documents based on text: More All The Duals Of Warfield Groups - Peter Loth (1997) (Correct) ... (Correct) BibTeX entry: (Update) Citations (may not include all citations): RSVP: A new resource reservation protocol - Zhang - 1993 Aspect-oriented programming - Kiczales - 1997 Treadmarks: Shared memory computing on networks of workstati.. - Amza, Cox - 1996 Coda: A highly available file system for a distributed works..

69. Open Problems In Number Theoretic Complexity, II - Adleman, McCurley (ResearchIn This paper contains a list of open problems in numbertheoretic complexity.We There are many open problems in this area. Adleman http://citeseer.nj.nec.com/168265.html

Open Problems in Number Theoretic Complexity, II (Make Corrections) (4 citations) Leonard M. Adleman, Kevin S. McCurley Home/Search Context Related View or download: sandia.gov/pub/papers/mccurle open.ps Cached: PS.gz PS PDF DjVu ... Help From: digicrime.com/~mccurley/bib (more) Homepages: L.Adleman K.Mccurley HPSearch (Update Links) Rate this article: (best) Comment on this article (Enter summary) Abstract: this paper contains a list of 36 open problems in numbertheoretic complexity. We expect that none of these problems are easy; we are sure that many of them are hard. This list of problems reflects our own interests and should not be viewed as definitive. As the field changes and becomes deeper, new problems will emerge and old problems will lose favor. Ideally there will be other `open problems' papers in future ANTS proceedings to help guide the field. It is likely that some of the problems... (Update) Context of citations to this paper: More ...strong. There are many open problems in this area. Adleman and McCurley give a list of open problems in number theoretic complexity in [AdMc] including a number of reduction problems.

70. Algorithmic Information Theory open problems and links to software. http://www.cs.auckland.ac.nz/CDMTCS/docs/ait.html

A LGORITHMIC I NFORMATION T HEORY Algorithmic information theory ( AIT ) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously. The basic idea is to measure the complexity of an object by the size in bits of the smallest program for computing it. ( G. J. Chaitin A NNIVERSARIES G. J. Chaitin. On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem, Proc. Lond. Math. Soc. (ser. 2) 42 (1936), 230-265; a correction 43 (1936), 544-546. O PEN P ROBLEMS Here is a compressed PostScript document containing a list of open problems in AIT. S OFTWARE FOR AIT Have a browse on Greg Chaitin's home page for some AIT-related software. Back to main page Information

71. REMARKS AND OPEN PROBLEMS REMARKS AND open problems. The formalism presented in part 3 is, we think, anadvance on previous attempts, but it is far from epistemological adequacy. http://www-formal.stanford.edu/jmc/mcchay69/node14.html

Next: The approximate character of Up: SOME PHILOSOPHICAL PROBLEMS FROM Previous: Knowledge and Ability REMARKS AND OPEN PROBLEMS The formalism presented in part is, we think, an advance on previous attempts, but it is far from epistemological adequacy. In the following sections we discuss a number of problems that it raises. For some of them we have proposals that might lead to solutions. The approximate character of Possible Meanings of `can' for a Computer Program The Frame Problem Formal Literatures ... Parallel Processing John McCarthy Mon Apr 29 19:20:41 PDT 1996

72. 8 Main Open Problems And Main Current Lines Of Investigation 8 Main open problems and Main Current Lines of Investigation. Hamiltonian constraint. Seethe original papers for suggestions and open problems. Black holes. http://www.livingreviews.org/Articles/Volume1/1998-1rovelli/node27.html

8 Main Open Problems and Main Current Lines of Investigation Hamiltonian constraint. The kinematics of the theory is well understood, both physically (quanta of area and volume, polymer-like geometry) and from the mathematical point of view ( , s-knot states, area and volume operators). The part of the theory which is not yet fully under control is the dynamics, which is determined by the hamiltonian constraint. A plausible candidate for the quantum hamiltonian constraint is the operator introduced by Thiemann [ ]. The commutators of the Thiemann operator with itself and with the diffeomorphism constraints close, and therefore the operator defines a complete and consistent quantum theory. However, doubts have been raised on the physical correctness of this theory, and some variants of the operator have been considered. The doubts originate from various considerations. First, Lewandowski, Marolf and others have stressed the fact the quantum constraint algebra closes, but it is not isomorphic to the classical constraint algebra of GR [ ]. Recently, a detailed analysis of this problem has been completed by Marolf, Lewandowski, Gambini and Pullin [

73. Open Problems With Piccola3 open problems with Piccola3. This page collects open questions and problemswith Piccola3 Syntax. Void argument only possible for uncurried services http://scgwiki.iam.unibe.ch:8080/SCG/352

Open Problems with Piccola3 This page collects open questions and problems with Piccola3 Syntax Void argument only possible for uncurried services: f: x means . However if f should be a service with more arguments, we have to invent a variable: multiline strings do not work for commenting code: ''" f x: println "Hello" g x: Z " does not work because the " in the first line closes the comment. Also does not work since the backslash n gets understood as newline. Proposal use triple quotes """ as deliminator for uninterpreted strings. Escape sequences What happens with escape sequences other than: . For example, what should be: Would like to escape the newline should escape the newline. Fixed in JPiccola 3.1f. See new specification of strings in Piccola3 Syntax Too liberal identifiers. It took me the whole afternoon to find the bug: The reason is is an identifier Thus it is not a service definition but an invocation..... This is fixed in JPiccola 3.1f. Identifiers must start and stop with an underscore, or they must be of the form: _ for prefix operators.

74. Perfect Graphs Conjectures and open problems, maintained at the AIM. http://www.aimath.org/WWN/perfectgraph/

Perfect Graphs This web page highlights some of the conjectures and open problems concerning Perfect Graphs. Click on the subject to see a short article on that topic. Please send comments/additions/corrections to webmaster@aimath.org If you would like to print a hard copy of the entire web page, you can download a dvi postscript or pdf version. Recognition of Perfect Graphs Polynomial Recognition Algorithm Found Interaction Between Skew-Partitions and 2-joins The Perfect-Graph Robust Algorithm Problem ... P4-structure and Its Relatives

75. Versions Of This Page (Open Problems With Piccola3) Versions of this Page (open problems with Piccola3). Version, Name, User, Date, Time.current, open problems with Piccola3, miraculix.unibe.ch, 19 June 2001, 34017 pm. http://scgwiki.iam.unibe.ch:8080/SCG/352.history

Versions of this Page (Open Problems with Piccola3) This document contains a history of this page, from the current version to the earliest one available. Version Name User Date Time current Open Problems with Piccola3 miraculix.unibe.ch 19 June 2001 3:40:17 pm Open Problems with Piccola3 miraculix.unibe.ch 8 June 2001 8:01:42 am Open Problems with Piccola3 miraculix.unibe.ch 8 June 2001 8:01:13 am Open Problems with Piccola3 miraculix.unibe.ch 15 May 2001 10:55:12 am Open Problems with Piccola3 miraculix.unibe.ch 4 May 2001 7:48:53 am Open Problems with Piccola3 miraculix.unibe.ch 4 May 2001 7:30:20 am Open Problems with Piccola3 miraculix.unibe.ch 30 April 2001 3:25:21 pm Open Problems with Piccola3 miraculix.unibe.ch 30 April 2001 3:25:10 pm Open Problems with Piccola3 miraculix.unibe.ch 30 April 2001 2:53:32 pm Open Problems with Piccola3 miraculix.unibe.ch 19 April 2001 4:51:26 pm Open Problems with Piccola3 miraculix.unibe.ch 19 April 2001 4:50:30 pm Open Problems with Piccola3 kilana.unibe.ch 18 April 2001 2:25:35 pm Open Problems with Piccola3 kilana.unibe.ch

76. 6.876 Open Problems 6.876/18.426 open problems, Observations, and Solved Problems. In papers.LaTeX Templates for writing up open problems or observations. http://theory.lcs.mit.edu/~miccianc/6876/open.html

6.876/18.426 Open Problems, Observations, and Solved Problems In each lecture, a student will be assigned to write down the open problems and interesting questions that arise during lecture. The problems should be written up in LaTeX or HTML (see templates below) with some discussion about the context in which the problem arises, the motivation for the problem, etc. Students are encouraged to work on these problems and write up any observations about these problems or any other issues related to lecture, no matter how "small". A compilation of such observations will be kept on this web page, and more substantial observations could potentially become publishable research papers. LaTeX Templates for writing up open problems or observations Preamble file: preamble.tex Sample "Open Problems" file: open.tex Sample "Observations" file: observe.tex If the next person who writes their problems in HTML also creates a template, it would be greatly appreciated! Open Problems and Interesting Questions Definitions of security against active adversaries , Tal Malkin (Feb. 3, 1999)

77. Open Problems With Signatures Nonstandard uses of signatures open problems with signatures. Thereare several open problems with signatures. Some we know that http://www.inf.ethz.ch/personal/gonnet/CAII/HeuristicAlgorithms/node23.html

Next: Signatures of boolean expressions Up: Heuristic equivalence testing and Previous: Non-standard uses of signatures Open problems with signatures There are several open problems with signatures. Some we know that are likely to be impossible to solve, as their solution would imply that P=NP. Others are still open and their solution may have a truly profound impact in practical and effective computer algebra. Signatures of boolean expressions Signature of Signature of Signature of a derivative ... Signatures of sets Gaston Gonnet

78. Open Problems Some open questions in algebraic logic. Problems of TS Ahmed Is there an uncountableatomic algebra A in Nr 3 CA \omega which has no complete representation? http://www.doc.ic.ac.uk/~imh/common_files/problems.html

Some open questions in algebraic logic Attributions are to the best of my knowledge corrections welcome, as are solutions. Below, unless otherwise stated, n denotes a finite integer. Is RRA axiomatisable in first-order logic with n variables, for any finite n? Is SRaCA closed under completions? (For n>5, SRaCA n is not closed under completions.) Is RA closed under completions? (For n>5, RA n is not closed under completions.) [Yde Venema] Is there a set of canonical equations axiomatising RRA? Is there a set of canonical equations axiomatising SRaCA n ? Same for RA n . (n>4 here.) Is the class of atom structures Str RCA n , for n at least 3 (possibly infinite), elementary? It is known that RA n properly contains SRaCA n for each n>4, and that SRaCA n is not finitely axiomatisable over RA n , but that the intersection of all RA n is RRA, which is contained in any given SRaCA n f(n) n for all n>4? Is there a recursive f? Is every algebra in SRaCA n (n>4) embeddable in a RA with a n-dimensional cylindric basis? (Not every atomic algebra in SRaCA n has a n-dimensional cylindric basis itself - eg a representable projective-plane-Lyndon algebra with at least 6 atoms has no 5-dimensional cylindric basis; but it clearly embeds in a RA with such a basis.)

79. Computability Theory Directory of researchers working in computability theory, and list of open problems. http://www.nd.edu/~cholak/computability/computability.html

Computability Theory Bibliographic Database for Computability Theory Open Questions in Recursion Theory: LaTeX or pdf Other Useful Sites: Association for Symbolic Logic People who work (or have worked) in Computability Theory: Klaus Ambos-Spies Valeriy Bulitko Sam Buss Bill Calhoun ... Sy Friedman Edward R. Griffor Valentina Harizanov Leo Harrington Denis R. Hirschfeldt Jeff Hirst ... Steffen Lempp Manuel Lerman Iraj Kalantari Jan Kraijeck Matrin Kummer David Marker Anil Nerode Yiannis Moschovakis ... Mike Yates People whose work had great impact on the field: Charles Babbage Alonzo Church Robin Gandy Reuben Goodstein ... Computability Theory E-mailing List Research Announcements Recursive Function Theory Newsletter Meetings (see the Association for Symbolic Logic for ASL meetings) Prizes Undergraduate essay prize on history and philosophy of computability (This does not seem to be the correct URL. I am not even sure if this prize still exists.) Graduate School in Computability Theory The University of Connecticut or The University of Connecticut Math Department home pagehere Univeristy of Notre Dame Job Announcements As with most web pages, this page is a continuously evolving resource. It will only develop into a useful resource for computability theorists if they help by adding information related to computability theory to the web and this page. Therefore computability theorists are encouraged to add information and links to this page. There are two ways of achieving this. The preferred method is to add the information to the web yourself and

80. Final Remarks And Open Problems Final Remarks and open problems. Venkatesan and Rajagopalan VR92showed that the distributional matrix representability problem http://www.uncg.edu/mat/avg/avgnp/node34.html

Next: References Up: Average-Case Intractable NP Problems Previous: Distributional Matrix Transformation Final Remarks and Open Problems Venkatesan and Rajagopalan showed that the distributional matrix representability problem is complete for DistNP by reducing the distributional Post correspondence problem to it under a randomized reduction. They also attempted to show that the bounded version of Diophantine problem is average-case NP-complete. Their approach, however, depends on a number theoretic conjecture that remains unproven. The unbounded version of the Diophantine problem is essentially Hilbert's tenth problem, which was shown to be undecidable by Matijasevic based on the work of Davis, Putnam, and Robinson . (A simplified proof of this result can be found from ). The bounded version of the Diophantine problem has been studied by Adleman and Manders DISTRIBUTIONAL DIOPHANTINE PROBLEMS Instance . A positive integers , and an integer polynomial of degree with variables, where is a free term. Question . Do there exist non-negative integers such that for , and Distribution . First randomly choose polynomial and then randomly and independently choose with respect to the default random distributions. The polynomial

Page 4     61-80 of 152    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20