user_id stringclasses 485
values | prompt stringlengths 107 6.24k | chosen_response stringlengths 12 180 | rejected stringlengths 12 179 | rejected_user_id stringclasses 485
values |
|---|---|---|---|---|
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT gates, threshold gates, etc. A unate circuit C is a combina... | Size-energy tradeoffs for unate circuits computing symmetric Boolean functions | Size and Energy of Threshold Circuits Computing Mod Functions | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components by deleting edges from G so that the total w... | Partitioning a weighted graph to connected subgraphs of almost uniform size | Partitioning a Weighted Tree into Subtrees with Weights in a Given Range | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Spanning trees rooted at a vertex r of a graph G are independent if, for each vertex v in G, all the paths connecting v and r in the trees are pairwise internally disjoint. In this paper we give a linear-time algori... | Finding Independent Spanning Trees in Partial k-Trees | A Linear Algorithm for Edge-Coloring Partial k-Trees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to nd an or- tho... | A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs | Algorithms for area-efficient orthogonal drawings | 4035 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are given integers such that 0≤l≤u. One wishes to partition G into connected components by deleting edges from G so that... | Partitioning a Weighted Tree into Subtrees with Weights in a Given Range | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Using a random deal of cards to players and a computatio-nally unlimited eavesdropper, all players wish to share a common
one-bit secret key which is information-theoretically secure from the eavesdrop-per. This ca... | Characterization of optimal key set protocols | A complete characterization of a family of key exchange protocols | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each... | List total colorings of series-parallel graphs | On the complexity of some colorful problems parameterized by treewidth | 40422 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pages given high score by the algorith... | Improvements of HITS Algorithms for Spam Links | Detecting Link Spam Using Temporal Information | 40476 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Many combinatorial problems are NP-complete for general graphs. However, when restricted to series–parallel graphs or partial k -trees, many of these problems can be solved in polynomial time, mostly in linear time.... | The edge-disjoint path problem is NP-complete for series-parallel graphs | Partitioning a weighted graph to connected subgraphs of almost uniform size | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: By a result of Holyer, unless P = NP, there does not exist a polynomial-time approximation algorithm to edge color a multigraph that always uses fewer than 43 χ′ colors, where χ′ is the optimal number of colors. Thi... | A better than “best possible” algorithm to edge color multigraphs | Multicolorings of Series-Parallel Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract:
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive integer, called the supply or the demand. Every
demand vertex v of T must be supplied an amount of ... | Minimum Cost Partitions of Trees with Supply and Demand | An FPTAS for minimizing the product of two non-negative linear cost functions | 40277 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which the drawing of an edge changes its ... | Orthogonal Drawings of Plane Graphs Without Bends | Algorithms for area-efficient orthogonal drawings | 4035 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G be a graph with a positive integer weight omega(v) for each vertex v. One wishes to assign each edge e of G a positive integer f(e) as a color so that omega(v) <= vertical bar f(e) - f(e')vertical bar for any ... | Generalized Edge-Colorings Of Weighted Graphs | Multicolorings of Series-Parallel Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A plane graph is a planar graph with a fixed embedding in the plane. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each ... | Rectangular drawings of planar graphs | Rectangular drawings of plane graphs without designated corners | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Lower bounds on the cardinality of the maximum matchings of planar graphs, with a constraint on the minimum degree, are established in terms of a linear polynomial of the number of vertices. The bounds depend upon t... | Lower bounds on the cardinality of the maximum matchings of planar graphs | The maximum degree of random planar graphs | 40211 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A hamiltonian walk of a graph is a shortest closed walk that passes through every vertex at least once, and the length is the total number of traversed edges. The hamiltonian walk problem in which one would like to ... | An Approximation Algorithm For The Hamiltonian Walk Problem On Maximal Planar Graphs | On the approximation of finding a(nother) hamiltonian cycle in cubic hamiltonian graphs | 40397 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Given axis-parallel rectangular obstacles and crossing areas together with two pairs of terminals on the plane, our algorithm finds a shortest pair of rectilinear paths which connect the pairs of terminals and neith... | Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas | Shortest Noncrossing Paths in Plane Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Given a graph G=(V, E), four distinct vertices u
1,u2,u3,u4
_boxclose^4 n_i = V\sum\nolimits_{i = 1}^4 {n_i = |V|}
, we wish to find a partition V
1, V2, V3, V4 of the vertex set V such that u
i Vi, ¦Vi¦=ni a... | A linear-time algorithm for four-partitioning four-connected planar graphs | A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract:
Given a graph G, a designated vertex r and a natural number k, we wish to find k independent spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v i... | A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs | Finding Independent Spanning Trees in Partial k-Trees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 ≤ i ≤ q, are given. One wishes to partition G into connected... | Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size | The edge-disjoint path problem is NP-complete for series-parallel graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: No abstract available.
| Finding Steiner forests in planar graphs | Free Kronecker decision diagrams and their application to Atmel 6000 series FPGA mapping | 40473 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line segment without any edge-intersection. It has been known that every planar graph G of n vertic... | Small grid drawings of planar graphs with balanced bipartition | Grid Drawings of 4-Connected Plane Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: No abstract available.
| Finding optimal edge-rankings of trees | Free Kronecker decision diagrams and their application to Atmel 6000 series FPGA mapping | 40473 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G be an undirected plane graph with nonnegative edge length, and letk terminal pairs lie on two specified face boundaries. This paper presents an algorithm for findingk “noncrossing paths” inG, each connecting a... | Shortest Noncrossing Paths in Plane Graphs | Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G be a graph in which each vertex v has a positive integer weight b(v) and each edge (v, w) has a nonnegative integer weight b(v, w). A bandwidth consecutive multicoloring, simply called a b-coloring of G, assig... | Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). | Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on... | Convex grid drawings of plane graphs with rectangular contours | Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A minimum ESOP (Exclusive-OR Sum-of-Products) form of a logic function f is an AND-EXOR 2-level expression of f having the minimum number of product terms. In the paper we deal with multiple-valued 2-input logic fun... | Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions | Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed-Muller (AND-EXOR) forms | 40473 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In this paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they have completely different physical meanings. Su... | Energy and depth of threshold circuits | Limiting negations in constant depth circuits | 40397 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The degree-constrained subgraphs decomposition problem, such as an f -coloring, an f -factorization, and a [ g , f ]-factorization, is to decompose a given graph G =( V , E ) to edge-disjoint subgraphs degree-constr... | Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings | Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: This paper deals with the multicommodity flow problems for two classes of planar undirected graphs. The first class C12 consists of graphs in which each source-sink pair is located on one of two specified face bound... | Multicommodity flows in planar undirected graphs and shortest paths | Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees | 40195 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The file transfer scheduling problem was introduced and studied by Coffman, Garey, Johnson and LaPaugh. The problem is to schedule transfers of a large collection of files between various nodes of a network under po... | Scheduling File Transfers under Port and Channel Constraints | Approximation algorithms for channel allocation problems in broadcast networks | 4047 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. A key sharing graph is one in which each vertex correspond... | Absolutely Secure Message Transmission using a Key Sharing Graph. | A complete characterization of a family of key exchange protocols | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Suppose that there are players in two hierarchical groups and a computationally unlimited eavesdropper. Using a random deal of cards, a player in the higher group wishes to send a one-bit message information-theoret... | Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups | A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In a convex grid drawing of a plane graph, every edge is drawn as a straight-line segment without any edge-intersection, every vertex is located at a grid point, and every facial cycle is drawn as a convex polygon. ... | Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids | Convex grid drawings of plane graphs with rectangular contours | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G = (V,E) be a plane graph with nonnegative edge weights, and let
<img src="/fulltext-image.asp?format=htmlnonpaginated&src=VW01081001H67X67_html\10878_2004_Article_333492_TeX2GIFIE1.gif" border="0" alt="
$$\ma... | Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition | Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G be a graph in which each vertex v has a positive integer weight b ( v ) and each edge ( v , w ) has a nonnegative integer weight b ( v , w ) . A bandwidth consecutive multicoloring, simply called a b-coloring ... | Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs | Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let C be a threshold logic circuit computing a Boolean function MOD$_m: \{ 0, 1\}^n \rightarrow \{0, 1\}$, where n 驴 1 and m 驴 2. Then C outputs "0" if the number of "1"s in an input x 驴 {0, 1} n to C is a multiple ... | Size and Energy of Threshold Circuits Computing Mod Functions | Energy and depth of threshold circuits | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Many combinatorial problems can be efficiently solved in parallel for series parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorith... | An NC parallel algorithm for edge-coloring series-parallel multigraphs | Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are integers such that 0 ≤ l ≤ u. One wishes to partition G into connected components by deleting edges from G so that t... | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | Partitioning a Weighted Tree into Subtrees with Weights in a Given Range | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a po... | Edge-Coloring and f-Coloring for Various Classes of Graphs | Algorithms for Finding f-Colorings of Partial k-Trees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In this paper, we consider the channel routing problem involving two-terminal nets on rectilinear grids. An efficient algorithm is described which necessarily finds a routing in a given grid whenever it exists. The ... | A Linear-Time Routing Algorithm for Convex Grids | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs | 40482 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: This paper addresses the problem of finding rectangular drawings of plane graphs, in which each vertex is drawn as a point, each edge is drawn as a horizontal or a vertical line segment, and the contour of each face... | Rectangular drawings of plane graphs without designated corners | Rectangular drawings of planar graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A series-parallel graph can be constructed from a certain graph by recurslvely applying "series" and "parallel" connections The class of such graphs, which Is a well-known model of series-parallel electrical network... | Linear-time computability of combinatorial problems on series-parallel graphs | The edge-disjoint path problem is NP-complete for series-parallel graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G be a simple graph in which each vertex v has a positive integer weight b(v) and each edge (v, w) has a nonnegative integer weight b(v, w). A bandwidth consecutive multicoloring of G assigns each vertex v a spe... | Bandwidth consecutive multicolorings of graphs. | Multicolorings of Series-Parallel Graphs | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels > i leaves connected components, each having... | Algorithms for generalized vertex-rankings of partial k-trees | Generalized Vertex-Rankings of Partial k-trees | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards for the transformation protocol to succeed ... | A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange | A complete characterization of a family of key exchange protocols | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Suppose that each vertex of a graph $$G$$ G is either a supply vertex or a demand vertex and is assigned a supply or a demand. All demands and supplies are nonnegative constant numbers in a steady network, while the... | Parametric power supply networks | Partitioning Trees With Supply, Demand And Edge-Capacity | 400 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: This paper proposes a new data structure called a variable-priority queue. The queue supports, in addition to the ordinary queue operations, an operation MIN to find an item of minimum key and three operations to ch... | Variable-Priority Queue and Doughnut Routing | Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems | 4047 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing i... | No-bend orthogonal drawings of series-parallel graphs | Algorithms for area-efficient orthogonal drawings | 4035 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A simple linear algorithm is presented for coloring planar graphs with at most five colors. The algorithm employs a recursive reduction of a graph involving the deletion of a vertex of degree 6 or less possibly toge... | A linear algorithm for five-coloring a planar graph | Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds | 40389 |
400 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Let G = (V, E) be a plane graph with nonnegative edge lengths, and let N be a family of k vertex sets N1, N2, . . ., Nk ⊆ V, called nets. Then a noncrossing Steiner forest for N in G is a set T of k trees T1; T2; . ... | Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs | Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs | 40177 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A local maximum intensity projection (MIP) approach to the extraction of a 3D vascular network, acquired by the Knife-Edge Scanning Microscope (KESM), is presented. We build a local volume for local MIP processing a... | A local maximum intensity projection tracing of vasculature in knife-edge scanning microscope volume data | Extraction of vascular network in 3D images | 4030 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In the neuronal circuits of natural and artificial agents, memory is usually implemented with recurrent connections, since recurrence allows past agent state to affect the present, on-going behavior. Here, an intere... | Emergence of Memory in Reactive Agents Equipped With Environmental Markers | Emergence of Memory-like Behavior in Reactive Agents Using External Markers | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Understanding neural connectivity and structures in the brain requires detailed three-dimensional (3D) anatomical models, and such an understanding is essential to the study of the nervous system. However, the recon... | Electron microscopy image segmentation with graph cuts utilizing estimated symmetric three-dimensional shape prior | Cell tracking and segmentation in electron microscopy images using graph cuts | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Goal-directed behavior is a hallmark of cognition. An important prerequisite to goal-directed behavior is that of prediction. In order to establish a goal and devise a plan, one needs to see into the future and pred... | Facilitating neural dynamics for delay compensation: a road to predictive neural dynamics? | Enhanced Facilitatory Neuronal Dynamics for Delay Compensation | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Tactile receptive fields (RFs) are similar to visual receptive fields, while there is a subtle difference. Our previous work showed that tactile RFs have advantage in texture boundary detection tasks compared to vis... | Tactile or visual?: Stimulus characteristics determine receptive field type in a self-organizing map model of cortical development | Relative Advantage Of Touch Over Vision In The Exploration Of Texture | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: A stationary display of white discs positioned on intersecting gray bars on a dark background gives rise to a striking scintillating effect--the scintillating grid illusion. The spatial and temporal properties of th... | A neural model of the scintillating grid illusion: disinhibition and self-inhibition in early vision. | Neural model of disinhibitory interactions in the modified Poggendorff illusion. | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Sensory data integration is an important task in human brain for multimodal processing as well as in machine learning for multisensor processing. alpha-integration was proposed by Amari as a principled way of blendi... | Learning Alpha-Integration With Partially-Labeled Data | Parameter learning for alpha integration. | 40250 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: How can artificial or natural agents autonomously gain understanding of its own internal (sensory) state? This is an important question not just for physically embodied agents but also for software agents in the inf... | Autonomous Acquisition of the Meaning of Sensory States Through Sensory-Invariance Driven Action | Motion-based autonomous grounding: inferring external world properties from encoded internal sensory states alone | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: We investigate how a humanoid robot with a randomly initialized binocular vision system can learn to improve judgments about egocentric distances using limited action and interaction that might be available to human... | Autonomous and Interactive Improvement of Binocular Visual Depth Estimation through Sensorimotor Interaction | Motion Planning Using Predicted Perceptive Capability | 40249 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Visual cortex neurons have receptive fields resembling oriented bandpass filters, and their response distributions on natural images are non-Gaussian. Inspired by this, we previously showed that comparing the respon... | Salience in orientation-filter response measured as suspicious coincidence in natural images | Enhancement of perceptually salient contours using a parallel artificial cortical network. | 40424 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In pattern recognition systems, data fusion is an important issue and evidence theory is one such method that has been successful. Many researchers have proposed different rules for evidence theory, and recently, a ... | Probabilistic Combination of Multiple Evidence | Alpha-integration of multiple evidence | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Speaker independent feature extraction is a critical problem in speech recognition. Oriented principal component analysis (OPCA) is a potential solution that can find a subspace robust against noise of the data set.... | Kernel Oriented Discriminant Analysis For Speaker-Independent Phoneme Spaces | Face recognition using kernel based fisher discriminant analysis | 4030 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: What is available to developmental programs in autonomous mental development, and what should be learned at the very early stages of mental development? Our observation is that sensory and motor primitives are the m... | Autonomous Learning Of The Semantics Of Internal Sensory States Based On Motor Exploration | Autonomous Acquisition of the Meaning of Sensory States Through Sensory-Invariance Driven Action | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Consciousness is a complex and multi-faceted phenomenon defying scientific explanation. Part of the reason why this is the case is due to its subjective nature. In our previous computational experiments, to avoid su... | Predictable internal brain dynamics in EEG and its relation to conscious states. | Analysis of EEG data using optimization, statistics, and dynamical system techniques | 40179 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Texture boundary detection (or segmentation) is an important capability in human vision. Usually, texture segmentation is viewed as a 2D problem, as the definition of the problem itself assumes a 2D substrate. Howev... | Segmentation of Textures Defined on Flat vs. Layered Surfaces using Neural Networks: Comparison of 2D vs. 3D Representations. | Relative Advantage Of Touch Over Vision In The Exploration Of Texture | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Early primitive animals with simple feed-forward neuronal circuits were limited to reactive behavior. Through evolution, they were gradually equipped with memory and became able to utilize information from the past.... | Emergence of Memory-like Behavior in Reactive Agents Using External Markers | Emergence of Memory in Reactive Agents Equipped With Environmental Markers | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Delay in the nervous system is a serious issue for an organism that needs to act in real time. For example, during the time a signal travels from a peripheral sensor to the central nervous system, a moving object in... | Facilitating neural dynamics for delay compensation and prediction in evolutionary neural networks | Extrapolative Delay Compensation Through Facilitating Synapses and Its Relation to the Flash-Lag Effect | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In pattern recognition, data integration is a processing method to combine multiple sources so that the combined result can be more accurate than a single source. Evidence theory is one of the methods that have been... | Alpha-integration of multiple evidence | Learning Alpha-Integration With Partially-Labeled Data | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In pattern recognition, data integration is an important issue, and when properly done, it can lead to improved performance. Also, data integration can be used to help model and understand multimodal processing in t... | Parameter learning for alpha integration. | Learning Alpha-Integration With Partially-Labeled Data | 40250 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Knife Edge Scanning Microscopy (KESM) is a high-throughput imaging technique used to obtain large-scale anatomical information (approximate to 1cm(3)) at sub-micrometer resolution. Data acquisition has been fully au... | Automated Cropping And Artifact Removal For Knife-Edge Scanning Microscopy | Fast Cell Detection In High-Throughput Imagery Using Gpu-Accelerated Machine Learning | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. However, the reconstruction of 3D mode... | Cell tracking and segmentation in electron microscopy images using graph cuts | Electron microscopy image segmentation with graph cuts utilizing estimated symmetric three-dimensional shape prior | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Based on recent experimental results on the connectivity and plasticity of the visual cortex, a new theory of the visual cortex has started to emerge. The visual cortex appears to be a continuously-adapting structur... | A Self-Organizing Neural Network Model Of The Primary Visual Cortex | SORN: a self-organizing recurrent neural network. | 40131 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: High-throughput microscopy allows fast imaging of large tissue samples, producing an unprecedented amount of subcellular information. The size and complexity of these data sets often out-scale current reconstruction... | Fast Cell Detection In High-Throughput Imagery Using Gpu-Accelerated Machine Learning | Scalable, incremental learning with MapReduce parallelization for cell detection in high-resolution 3D microscopy data | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The Mouse Brain Web (MBW), a web-organized database, provides for the construction of anatomically correct models of mouse brain networks. Each web page in this database provides the position, orientation, morpholog... | Construction of Anatomically Correct Models of Mouse Brain Networks | BrainNetVis: An Open-Access Tool to Effectively Quantify and Visualize Brain Networks. | 4035 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Visual illusions can be strengthened or weakened with the addition of extra visual elements. For example, in the Poggendorff illusion, with an additional bar added, the illusory skew in the perceived angle can be en... | Neural model of disinhibitory interactions in the modified Poggendorff illusion. | Explaining Low-Level Brightness-Contrast Illusions Using Disinhibition | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Accurate estimation of neuronal count and distribution is central to the understanding of the organization and layout of cortical maps in the brain, and changes in the cell population induced by brain disorders. Hig... | Scalable, incremental learning with MapReduce parallelization for cell detection in high-resolution 3D microscopy data | Fast Cell Detection In High-Throughput Imagery Using Gpu-Accelerated Machine Learning | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors at a time so that each sensory info... | Manifold integration with Markov random walks | Manifold-ranking based retrieval using k-regular nearest neighbor graph | 40459 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Neural conduction delay is a serious issue for organisms that need to act in real time. Various forms of flash-lag effect (FLE) suggest that the nervous system may perform extrapolation to compensate for delay. For ... | Extrapolative Delay Compensation Through Facilitating Synapses and Its Relation to the Flash-Lag Effect | Delay Compensation Through Facilitating Synapses and STDP: A Neural Basis for Orientation Flash-Lag Effect | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: The blood vessels in the retina have a characteristic radiating pattern, while there exists a significant variation dependent on the individual and/or medical condition. Extracting the geometric properties of these ... | Fast and accurate retinal vasculature tracing and kernel-Isomap-based feature selection | Automatic retinal vessel extraction based on directional mathematical morphology and fuzzy classification | 40102 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Neural transmission delay may cause serious problems unless a compensation mechanism exists in the neural system. We showed previously that facilitating neural dynamics is a key mechanism to compensate for delay in ... | Predictive internal neural dynamics for delay compensation | Facilitating neural dynamics for delay compensation: a road to predictive neural dynamics? | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However these approaches have not factored in delay, which plays an important ro... | Effects Of Varying The Delay Distribution In Random, Scale-Free, And Small-World Networks | Coarsening Massive Influence Networks for Scalable Diffusion Analysis. | 4085 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Our earlier work has suggested that neuronal transmission delay may cause serious problems unless a compensation mechanism exists. In that work, facilitating neuronal dynamics was found to be effective in battling d... | Enhanced Facilitatory Neuronal Dynamics for Delay Compensation | Facilitating neural dynamics for delay compensation: a road to predictive neural dynamics? | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: This paper describes a new semi-supervised learning algorithm for intra-class clustering (ICC). ICC partitions each class into sub-classes in order to minimize overlap across clusters from different classes. This is... | Context-sensitive intra-class clustering | Semi-supervised Discriminant Analysis Via CCCP | 4090 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Tool use requires high levels of cognitive function and is only observed in higher mammals and some avian species such as corvids. In this paper, we will investigate how the capability to use tools can spontaneously... | Emergence Of Tool Use In An Articulated Limb Controlled By Evolved Neural Circuits | From visuo-motor self learning to early imitation-a neural architecture for humanoid learning | 40160 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Manual editing can correct segmentation errors produced by automated segmentation algorithms, but it also introduces a practical challenge: the combination of multiple users' annotations of an image to obtain an est... | Ground truth estimation by maximizing topological agreements in electron microscopy data | An interactive editing framework for electron microscopy image segmentation | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Reverse engineering of genetic regulatory networks from experimental data is the first step toward the modeling of genetic networks. Linear state-space models, also known as linear dynamical models, have been applie... | Structural systems identification of genetic regulatory networks. | Probabilistic inference of transcription factor concentrations and gene-specific regulatory activities. | 4072 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Conventional Difference of Gaussian (DOG) filter is usually used to model the early stage of visual processing. However, convolution operation used with DOG does not explicitly account for the effects of disinhibiti... | Explaining Low-Level Brightness-Contrast Illusions Using Disinhibition | Neural model of disinhibitory interactions in the modified Poggendorff illusion. | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: In orientation flash-lag effect (FLE), a continuously rotating bar in the center is perceived to be misaligned toward the direction of rotation when compared to a briefly flashed pair of flanking bars that are actua... | Delay Compensation Through Facilitating Synapses and STDP: A Neural Basis for Orientation Flash-Lag Effect | Extrapolative Delay Compensation Through Facilitating Synapses and Its Relation to the Flash-Lag Effect | 401 |
401 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: How multiple specialized cortical areas in the brain interact with each other to give rise to an integrated behavior is a largely unanswered question. This paper proposes that such an integration can be understood u... | The role of temporal parameters in a thalamocortical model of analogy. | Analogical cascade: a theory on the role of the thalamo-cortical loop in brain function. | 401 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Solid State Disks (SSDs) using NAND flash memory are increasingly being adopted in the high-end servers of data- centers to improve performance of the I/O-intensive applications. Compared to the traditional enterpri... | Large Block CLOCK (LB-CLOCK): A write caching algorithm for solid state disks | Design and Prototype of a Solid-State Cache | 40157 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Stochastic number generator (SNG) is one important component of stochastic computing (SC). An SNG usually consists of a random number source (RNS) and a probability conversion circuit (PCC). The SNGs occupy a large ... | Towards Theoretical Cost Limit of Stochastic Number Generators for Stochastic Computing | Using stochastic computing to implement digital image processing algorithms | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Growing uncertainty in design parameters (and therefore, in design functionality) renders stochastic computing particularly promising, which represents and processes data as quantized probabilities. However, due to ... | On Memory System Design for Stochastic Computing. | An efficient implementation of numerical integration using logical computation on stochastic bit streams | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Detecting and predicting a program's execution phases are crucial to dynamic optimizations and dynamically adaptable systems. This paper shows that a phase can be associated with dynamic code regions embedded in loo... | Dynamic code region (DCR) based program phase tracking and prediction for dynamic optimizations | Control flow prediction for dynamic ILP processors | 40117 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Stochastic encoding represents a value using the probability of ones in a random bit stream. Computation based on this encoding has good fault-tolerance and low hardware cost. However, one of its major issues is lon... | Accelerating the performance of stochastic encoding-based computations by sharing bits in consecutive bit streams | Computation on Stochastic Bit Streams Digital Image Processing Case Studies | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: As device scaling continues to nanoscale dimensions, circuit reliability will continue to become an ever greater problem. Stochastic computing, which performs computing with random bits (stochastic bits streams), ca... | Using stochastic computing to implement digital image processing algorithms | Computation on Stochastic Bit Streams Digital Image Processing Case Studies | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Artificial neural networks are powerful computational systems with interconnected neurons. Generally, these networks have a very large number of computation nodes which forces the designer to use software-based impl... | Using Stochastic Computing to Reduce the Hardware Requirements for a Restricted Boltzmann Machine Classifier. | Practical implementation of a network-based stochastic biochemical simulation system on an FPGA | 40212 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Maintaining the reliability of integrated circuits as transistor sizes continue to shrink to nanoscale dimensions is a significant looming challenge for the industry. Computation on stochastic bit streams, which cou... | Computation on Stochastic Bit Streams Digital Image Processing Case Studies | Using stochastic computing to implement digital image processing algorithms | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that different addresses containing the same ... | Improving Data Cache Performance via Address Correlation: An Upper Bound Study | Address Correlation: Exceeding the Limits of Locality | 402 |
402 | Given a paper abstract, generate a title for the paper. Only output the title, no other text.
Abstract: Radiation induced single-event upsets are becoming an increasing issue for designers due to the impact on overall design reliability. This paper presents a method for translating probabilistic information from lower... | Statistically translating low-level error probabilities to increase the accuracy and efficiency of reliability simulations in hardware description languages | MEMESTAR: A Simulation Framework for Reliability Evaluation over Multiple Environments | 402 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 70