summary stringlengths 73 1.77k | document stringlengths 395 24.8k | coref_clusters stringlengths 57 18.1k | srl stringlengths 2.91k 146k |
|---|---|---|---|
Two other generalizations that can be considered are invariants of graphs in 3-manifolds, and invariants associated to other flat connections cite . We will analyze these in future work. Among other things, there should be a general relation between flat bundles and links in 3-manifolds on the one hand and finite cover... | Author(s): Kuperberg, Greg; Thurston, Dylan P. | Abstract: We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish some basic properties of... | "{\"document\": {\"0\": [[{\"mention\": \"We\", \"char_span\": [59, 61]}, {\"mention\": \"Our\", \"char_span\": [206, 209]}, {\"mention\": \"We\", \"char_span\": [273, 275]}], [{\"mention\": \"a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons fi... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"we\", \"span\": [59, 61]}, {\"type\": \"relation\", \"value\": \"give\", \"span\": [62, 66]}, {\"type\": \"patient\", \"value\": \"purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with chern-simo... |
Model Based Dynamic Programming, hereafter referred to as MBDP-1 cite , is probably the most recent work that addresses the exact same issue as that considered in this paper. Both the approach presented in this paper and Brent's MBDP-1 are based on explicit probability models. Approaches not based on explicit probabili... | A statistical model for segmentation and word discovery in child directed speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described and results of empirical tests showing that the algorithm is competitive with other models that have been used for simil... | "{\"document\": {\"0\": [[{\"mention\": \"A statistical model for segmentation and word discovery in child directed speech\", \"char_span\": [0, 80]}, {\"mention\": \"this model\", \"char_span\": [176, 186]}], [{\"mention\": \"An incremental unsupervised learning algorithm to infer word boundaries based on this model\"... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"child\", \"span\": [59, 64]}, {\"type\": \"relation\", \"value\": \"direct\", \"span\": [65, 73]}, {\"type\": \"patient\", \"value\": \"speech\", \"span\": [74, 80]}], [{\"type\": \"relation\", \"value\": \"present\", \"span\": [84, 93]}, {\"type\": \... |
Recently we were able to characterize the graphs that can occur at most @math times as a subgraph isomorph in an @math -vertex planar graph: they are exactly the 3-connected planar graphs cite . However our proof does not lead to an efficient algorithm for 3-connected planar subgraph isomorphism. In this paper we use d... | We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph... | "{\"document\": {\"0\": [[{\"mention\": \"We\", \"char_span\": [0, 2]}, {\"mention\": \"Our\", \"char_span\": [109, 112]}]], \"1\": [[{\"mention\": \"contains\", \"char_span\": [39, 47]}, {\"mention\": \"this\", \"char_span\": [91, 95]}], [{\"mention\": \"G\", \"char_span\": [126, 127]}, {\"mention\": \"G\", \"char_spa... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"we\", \"span\": [0, 2]}, {\"type\": \"relation\", \"value\": \"solve\", \"span\": [3, 8]}, {\"type\": \"patient\", \"value\": \"subgraph isomorphism problem in planar graphs\", \"span\": [9, 58]}, {\"type\": \"recipient\", \"value\": \"linear time\", ... |
A further genuine and important approach to the spinor-tensor transition was developed starting probably with Crawford by P. Lounesto, cite and references there. He investigated the question, how a spinor field can be reconstructed from known tensor densities. The major characterization is derived, using Fierz-Kofink i... | Daviau showed the equivalence of matrix Dirac theory, formulated within a spinor bundle (S_x C _x^4 ), to a Clifford algebraic formulation within space Clifford algebra (C ( R ^3 , ) M _ 2 ( C ) P ) Pauli algebra (matrices) ≃ H ⨁ H ≃ biquaternions. We will show, that Daviau's map θ: ( : C ^4 M _ 2 ( C ) ) is an isomorp... | "{\"document\": {\"0\": [[{\"mention\": \"Daviau\", \"char_span\": [0, 6]}, {\"mention\": \"Daviau's\", \"char_span\": [268, 276]}, {\"mention\": \"Daviau's\", \"char_span\": [396, 404]}, {\"mention\": \"Daviau's\", \"char_span\": [764, 772]}, {\"mention\": \"Daviau\", \"char_span\": [895, 901]}], [{\"mention\": \"The ... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"daviau\", \"span\": [0, 6]}, {\"type\": \"relation\", \"value\": \"show\", \"span\": [7, 13]}, {\"type\": \"patient\", \"value\": \"equivalence of matrix dirac theory, formulated within a spinor bundle (s_x c _x^4 ), to a clifford algebraic formulatio... |
Pioneering research in dynamic runtime optimization was done by Hansen cite who first described a fully automated system for runtime code optimization. His system was similar in structure to our system---it was composed of a loader, a profiler, and an optimizer---but used profiling data only to decide when to optimize ... | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... | "{\"document\": {\"0\": [[{\"mention\": \"We\", \"char_span\": [0, 2]}, {\"mention\": \"we\", \"char_span\": [301, 303]}], [{\"mention\": \"these properties\", \"char_span\": [315, 331]}, {\"mention\": \"These properties\", \"char_span\": [474, 490]}]], \"1\": [[{\"mention\": \"a practical system\", \"char_span\": [650... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"we\", \"span\": [0, 2]}, {\"type\": \"relation\", \"value\": \"present\", \"span\": [3, 10]}, {\"type\": \"patient\", \"value\": \"open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and ext... |
Hansen's work was followed by several other projects that have investigated the benefits of runtime optimization: the Smalltalk cite and SELF cite systems that focused on the benefits of dynamic optimization in an object-oriented environment; Morph'', a project developed at Harvard University cite ; and the system desc... | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... | "{\"document\": {\"0\": [[{\"mention\": \"We\", \"char_span\": [0, 2]}, {\"mention\": \"we\", \"char_span\": [301, 303]}], [{\"mention\": \"these properties\", \"char_span\": [315, 331]}, {\"mention\": \"These properties\", \"char_span\": [474, 490]}]], \"1\": [[{\"mention\": \"the Java Virtual Machine\", \"char_span\"... | "{\"document\": {\"0\": {\"0\": [[{\"type\": \"agent\", \"value\": \"we\", \"span\": [0, 2]}, {\"type\": \"relation\", \"value\": \"present\", \"span\": [3, 10]}, {\"type\": \"patient\", \"value\": \"open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and ext... |
"Common to the above-mentioned work is that the main focus has always been on functional aspects, th(...TRUNCATED) | "We present an open architecture for just-in-time code generation and dynamic code optimization that(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": [[{\\\"mention\\\": \\\"We\\\", \\\"char_span\\\": [0, 2]}, {\\\"m(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": {\\\"0\\\": [[{\\\"type\\\": \\\"agent\\\", \\\"value\\\": \\\"we\(...TRUNCATED) |
"For Tcl cite two integration solutions exist: the TclBlend binding cite and the Jacl implementation(...TRUNCATED) | "Scripting languages are becoming more and more important as a tool for software development, as the(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": [[{\\\"mention\\\": \\\"Scripting languages\\\", \\\"char_span\\\"(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": {\\\"0\\\": [[{\\\"type\\\": \\\"relation\\\", \\\"value\\\": \\\"(...TRUNCATED) |
"The main objective of this chapter was to study the basic @math -branes that one encounters in M-th(...TRUNCATED) | "The thesis begins with an introduction to M-theory (at a graduate student's level), starting from p(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": [[{\\\"mention\\\": \\\"Black and extremal branes\\\", \\\"char_sp(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": {\\\"0\\\": [[{\\\"type\\\": \\\"relation\\\", \\\"value\\\": \\\"(...TRUNCATED) |
"It should also not be underestimated that the derivation of the intersecting solutions presented in(...TRUNCATED) | "The thesis begins with an introduction to M-theory (at a graduate student's level), starting from p(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": [[{\\\"mention\\\": \\\"Black and extremal branes\\\", \\\"char_sp(...TRUNCATED) | "\"{\\\"document\\\": {\\\"0\\\": {\\\"0\\\": [[{\\\"type\\\": \\\"relation\\\", \\\"value\\\": \\\"(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 33