Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed because of a cast error
Error code: DatasetGenerationCastError
Exception: DatasetGenerationCastError
Message: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 3 new columns ({'node_id', 'neighbour', 'label'}) and 5 missing columns ({'ID', 'label_id', 'abstract', 'mag_id', 'title'}).
This happened while the csv dataset builder was generating data using
hf://datasets/Sherirto/CSTAG/Children/Children.csv (at revision 7e59eaee59c806a0a1119f6c432437e85cf53d0b)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)
Traceback: Traceback (most recent call last):
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 2011, in _prepare_split_single
writer.write_table(table)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/arrow_writer.py", line 585, in write_table
pa_table = table_cast(pa_table, self._schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2302, in table_cast
return cast_table_to_schema(table, schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2256, in cast_table_to_schema
raise CastError(
datasets.table.CastError: Couldn't cast
category: string
text: string
label: int64
node_id: int64
neighbour: string
-- schema metadata --
pandas: '{"index_columns": [{"kind": "range", "name": null, "start": 0, "' + 823
to
{'ID': Value(dtype='int64', id=None), 'mag_id': Value(dtype='int64', id=None), 'title': Value(dtype='string', id=None), 'abstract': Value(dtype='string', id=None), 'label_id': Value(dtype='int64', id=None), 'category': Value(dtype='string', id=None), 'text': Value(dtype='string', id=None)}
because column names don't match
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1321, in compute_config_parquet_and_info_response
parquet_operations = convert_to_parquet(builder)
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 935, in convert_to_parquet
builder.download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1027, in download_and_prepare
self._download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1122, in _download_and_prepare
self._prepare_split(split_generator, **prepare_split_kwargs)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1882, in _prepare_split
for job_id, done, content in self._prepare_split_single(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 2013, in _prepare_split_single
raise DatasetGenerationCastError.from_cast_error(
datasets.exceptions.DatasetGenerationCastError: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 3 new columns ({'node_id', 'neighbour', 'label'}) and 5 missing columns ({'ID', 'label_id', 'abstract', 'mag_id', 'title'}).
This happened while the csv dataset builder was generating data using
hf://datasets/Sherirto/CSTAG/Children/Children.csv (at revision 7e59eaee59c806a0a1119f6c432437e85cf53d0b)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
ID int64 | mag_id int64 | title string | abstract string | label_id int64 | category string | text string |
|---|---|---|---|---|---|---|
0 | 9,657,784 | Title: evasion attacks against machine learning at test time | Abstract: In security-sensitive applications, the success of machine learning depends on a thorough vetting of their resistance to adversarial data. In one pertinent, well-motivated attack scenario, an adversary may attempt to evade a deployed system at test time by carefully manipulating attack samples. In this work, ... | 4 | arxiv cs cr | Title: evasion attacks against machine learning at test time. Abstract: In security-sensitive applications, the success of machine learning depends on a thorough vetting of their resistance to adversarial data. In one pertinent, well-motivated attack scenario, an adversary may attempt to evade a deployed system at test... |
1 | 39,886,162 | Title: how hard is computing parity with noisy communications | Abstract: We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit and communicating with others using local transmissions with powe... | 5 | arxiv cs dc | Title: how hard is computing parity with noisy communications. Abstract: We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit an... |
2 | 116,214,155 | Title: on the absence of the rip in real world applications of compressed sensing and the rip in levels | Abstract: The purpose of this paper is twofold. The first is to point out that the Restricted Isometry Property (RIP) does not hold in many applications where compressed sensing is successfully used. This includes fields like Magnetic Resonance Imaging (MRI), Computerized Tomography, Electron Microscopy, Radio Interfer... | 28 | arxiv cs it | Title: on the absence of the rip in real world applications of compressed sensing and the rip in levels. Abstract: The purpose of this paper is twofold. The first is to point out that the Restricted Isometry Property (RIP) does not hold in many applications where compressed sensing is successfully used. This includes f... |
3 | 121,432,379 | Title: a promise theory perspective on data networks | Abstract: Networking is undergoing a transformation throughout our industry. The shift from hardware driven products with ad hoc control to Software Defined Networks is now well underway. In this paper, we adopt the perspective of the Promise Theory to examine the current state of networking technologies so that we mig... | 8 | arxiv cs ni | Title: a promise theory perspective on data networks. Abstract: Networking is undergoing a transformation throughout our industry. The shift from hardware driven products with ad hoc control to Software Defined Networks is now well underway. In this paper, we adopt the perspective of the Promise Theory to examine the c... |
4 | 231,147,053 | Title: analysis of asymptotically optimal sampling based motion planning algorithms for lipschitz continuous dynamical systems | Abstract: Over the last 20 years significant effort has been dedicated to the development of sampling-based motion planning algorithms such as the Rapidly-exploring Random Trees (RRT) and its asymptotically optimal version (e.g. RRT*). However, asymptotic optimality for RRT* only holds for linear and fully actuated sys... | 27 | arxiv cs ro | Title: analysis of asymptotically optimal sampling based motion planning algorithms for lipschitz continuous dynamical systems. Abstract: Over the last 20 years significant effort has been dedicated to the development of sampling-based motion planning algorithms such as the Rapidly-exploring Random Trees (RRT) and its ... |
5 | 1,196,386,999 | Title: the edge group coloring problem with applications to multicast switching | Abstract: This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the performance of several approximation algorithms, both analytically and exp... | 34 | arxiv cs ds | Title: the edge group coloring problem with applications to multicast switching. Abstract: This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evalua... |
6 | 1,444,859,417 | Title: webvrgis based city bigdata 3d visualization and analysis | Abstract: This paper shows the WEBVRGIS platform overlying multiple types of data about Shenzhen over a 3d globe. The amount of information that can be visualized with this platform is overwhelming, and the GIS-based navigational scheme allows to have great flexibility to access the different available data sources. Fo... | 6 | arxiv cs hc | Title: webvrgis based city bigdata 3d visualization and analysis. Abstract: This paper shows the WEBVRGIS platform overlying multiple types of data about Shenzhen over a 3d globe. The amount of information that can be visualized with this platform is overwhelming, and the GIS-based navigational scheme allows to have gr... |
7 | 1,483,430,697 | Title: information theoretic authentication and secrecy codes in the splitting model | Abstract: In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata-Kurosawa-Stinson-Saido (2004) have constru... | 4 | arxiv cs cr | Title: information theoretic authentication and secrecy codes in the splitting model. Abstract: In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect o... |
8 | 1,486,601,621 | Title: whealth transforming telehealth services | Abstract: A worldwide increase in proportions of older people in the population poses the challenge of managing their increasing healthcare needs within limited resources. To achieve this many countries are interested in adopting telehealth technology. Several shortcomings of state-of-the-art telehealth technology cons... | 3 | arxiv cs cy | Title: whealth transforming telehealth services. Abstract: A worldwide increase in proportions of older people in the population poses the challenge of managing their increasing healthcare needs within limited resources. To achieve this many countries are interested in adopting telehealth technology. Several shortcomin... |
9 | 1,495,847,259 | Title: nonparametric decentralized sequential detection via universal source coding | Abstract: We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated fr om spectrum sensing in Cognitive Radios and intru... | 28 | arxiv cs it | Title: nonparametric decentralized sequential detection via universal source coding. Abstract: We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These al... |
10 | 1,500,126,713 | Title: online learning in decentralized multiuser resource sharing problems | Abstract: In this paper, we consider the general scenario of resource sharing in a decentralized system when the resource rewards/qualities are time-varying and unknown to the users, and using the same resource by multiple users leads to reduced quality due to resource sharing. Firstly, we consider a user-independent r... | 24 | arxiv cs lg | Title: online learning in decentralized multiuser resource sharing problems. Abstract: In this paper, we consider the general scenario of resource sharing in a decentralized system when the resource rewards/qualities are time-varying and unknown to the users, and using the same resource by multiple users leads to reduc... |
11 | 1,512,190,626 | Title: truthful secretaries with budgets | Abstract: We study online auction settings in which agents arrive and depart dynamically in a random (secretary) order, and each agent's private type consists of the agent's arrival and departure times, value and budget. We consider multi-unit auctions with additive agents for the allocation of both divisible and indiv... | 36 | arxiv cs gt | Title: truthful secretaries with budgets. Abstract: We study online auction settings in which agents arrive and depart dynamically in a random (secretary) order, and each agent's private type consists of the agent's arrival and departure times, value and budget. We consider multi-unit auctions with additive agents for ... |
12 | 1,524,631,297 | Title: improving the bound on the rip constant in generalized orthogonal matching pursuit | Abstract: The generalized Orthogonal Matching Pursuit (gOMP) is a recently proposed compressive sensing greedy recovery algorithm which generalizes the OMP algorithm by selecting N( ≥ 1) atoms in each iteration. In this letter, we demonstrate that the gOMP can successfully reconstruct a K-sparse signal from a compresse... | 28 | arxiv cs it | Title: improving the bound on the rip constant in generalized orthogonal matching pursuit. Abstract: The generalized Orthogonal Matching Pursuit (gOMP) is a recently proposed compressive sensing greedy recovery algorithm which generalizes the OMP algorithm by selecting N( ≥ 1) atoms in each iteration. In this letter, w... |
13 | 1,525,384,803 | Title: a system for reflection in c | Abstract: Object-oriented programming languages such as Java and Objective C have become popular for implementing agent-based and other object-based simulations since objects in those languages can {\em reflect} (i.e. make runtime queries of an object's structure). This allows, for example, a fairly trivial {\em serial... | 22 | arxiv cs pl | Title: a system for reflection in c. Abstract: Object-oriented programming languages such as Java and Objective C have become popular for implementing agent-based and other object-based simulations since objects in those languages can {\em reflect} (i.e. make runtime queries of an object's structure). This allows, for ... |
14 | 1,528,301,850 | Title: a bi level view of inpainting based image compression | Abstract: Inpainting based image compression approaches, especially linear and non-linear diffusion models, are an active research topic for lossy image compression. The major challenge in these compression models is to find a small set of descriptive supporting points, which allow for an accurate reconstruction of the... | 16 | arxiv cs cv | Title: a bi level view of inpainting based image compression. Abstract: Inpainting based image compression approaches, especially linear and non-linear diffusion models, are an active research topic for lossy image compression. The major challenge in these compression models is to find a small set of descriptive suppor... |
15 | 1,537,465,387 | Title: distributed graph automata | Abstract: Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deterministic, we also obtain two strict... | 33 | arxiv cs fl | Title: distributed graph automata. Abstract: Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deter... |
16 | 1,539,916,885 | Title: randomness efficient rumor spreading | Abstract: We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the protocol informs every node in $O(\log n)$ rounds with high probabilit... | 34 | arxiv cs ds | Title: randomness efficient rumor spreading. Abstract: We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the protocol informs every no... |
17 | 1,542,788,159 | Title: back to the past source identification in diffusion networks from partially observed cascades | Abstract: When a piece of malicious information becomes rampant in an information diffusion network, can we identify the source node that originally introduced the piece into the network and infer the time when it initiated this? Being able to do so is critical for curtailing the spread of malicious information, and re... | 26 | arxiv cs si | Title: back to the past source identification in diffusion networks from partially observed cascades. Abstract: When a piece of malicious information becomes rampant in an information diffusion network, can we identify the source node that originally introduced the piece into the network and infer the time when it init... |
18 | 1,544,145,018 | Title: bayesian two sample tests | Abstract: In this paper, we present two classes of Bayesian approaches to the two-sample problem. Our first class of methods extends the Bayesian t-test to include all parametric models in the exponential family and their conjugate priors. Our second class of methods uses Dirichlet process mixtures (DPM) of such conjug... | 24 | arxiv cs lg | Title: bayesian two sample tests. Abstract: In this paper, we present two classes of Bayesian approaches to the two-sample problem. Our first class of methods extends the Bayesian t-test to include all parametric models in the exponential family and their conjugate priors. Our second class of methods uses Dirichlet pro... |
19 | 1,546,946,208 | Title: electrical structure based pmu placement in electric power systems | Abstract: Recent work on complex networks compared the topological and electrical structures of the power grid, taking into account the underlying physical laws that govern the electrical connectivity between various components in the network. A distance metric, namely, resistance distance was introduced to provide a m... | 19 | arxiv cs sy | Title: electrical structure based pmu placement in electric power systems. Abstract: Recent work on complex networks compared the topological and electrical structures of the power grid, taking into account the underlying physical laws that govern the electrical connectivity between various components in the network. A... |
20 | 1,550,373,401 | Title: on state dependent broadcast channels with cooperation | Abstract: In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First, we study a setting in which one decoder can use a finite capacity link ... | 28 | arxiv cs it | Title: on state dependent broadcast channels with cooperation. Abstract: In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First, we study... |
21 | 1,551,937,652 | Title: detecting simultaneous integer relations for several real vectors | Abstract: An algorithm which either finds an nonzero integer vector m for given t real n-dimensional vectors x1,��� , xt such that x T m = 0 or proves that no such integer vector with norm less than a given bound exists is presented in this paper. The cost of the algorithm is at mostO(n 4 + n 3 log�(X)) exact arithmeti... | 14 | arxiv cs sc | Title: detecting simultaneous integer relations for several real vectors. Abstract: An algorithm which either finds an nonzero integer vector m for given t real n-dimensional vectors x1,��� , xt such that x T m = 0 or proves that no such integer vector with norm less than a given bound exists is presented in this paper... |
22 | 1,553,895,888 | Title: shannon meets carnot mutual information via thermodynamics | Abstract: In this contribution, the Gaussian channel is represented as an equivalent thermal system allowing to express its input-output mutual information in terms of thermodynamic quantities. This thermodynamic description of the mutual information is based upon a generalization of the $2^{nd}$ thermodynamic law and ... | 28 | arxiv cs it | Title: shannon meets carnot mutual information via thermodynamics. Abstract: In this contribution, the Gaussian channel is represented as an equivalent thermal system allowing to express its input-output mutual information in terms of thermodynamic quantities. This thermodynamic description of the mutual information is... |
23 | 1,555,565,700 | Title: on list decodability of random rank metric codes | Abstract: In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0 0$ ($\epsilon$ and $R$ are independent), if $0 0$ and any $0<\rho<1$, with high probability a random $F_q$-linear rank metric codes with rate $R=(1-\rh... | 28 | arxiv cs it | Title: on list decodability of random rank metric codes. Abstract: In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0 0$ ($\epsilon$ and $R$ are independent), if $0 0$ and any $0<\rho<1$, with high probability a ... |
24 | 1,556,595,261 | Title: dealing with run time variability in service robotics towards a dsl for non functional properties | Abstract: Service robots act in open-ended, natural environments. Therefore, due to combinatorial explosion of potential situations, it is not possible to foresee all eventualities in advance during robot design. In addition, due to limited resources on a mobile robot, it is not feasible to plan any action on demand. H... | 27 | arxiv cs ro | Title: dealing with run time variability in service robotics towards a dsl for non functional properties. Abstract: Service robots act in open-ended, natural environments. Therefore, due to combinatorial explosion of potential situations, it is not possible to foresee all eventualities in advance during robot design. I... |
25 | 1,561,232,457 | Title: a characterisation of context sensitive languages by consensus games | Abstract: We propose a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input information. The players have a joint objec- tive to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that t... | 33 | arxiv cs fl | Title: a characterisation of context sensitive languages by consensus games. Abstract: We propose a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input information. The players have a joint objec- tive to avoid an inadmissib... |
26 | 1,561,890,487 | Title: data structures for approximate range counting | Abstract: We present new data structures for approximately counting the number of points in orthogonal range. #R##N#There is a deterministic linear space data structure that supports updates in O(1) time and approximates the number of elements in a 1-D range up to an additive term $k^{1/c}$ in $O(\log \log U\cdot\log \... | 34 | arxiv cs ds | Title: data structures for approximate range counting. Abstract: We present new data structures for approximately counting the number of points in orthogonal range. #R##N#There is a deterministic linear space data structure that supports updates in O(1) time and approximates the number of elements in a 1-D range up to ... |
27 | 1,566,387,761 | Title: holographic transformation for quantum factor graphs | Abstract: Recently, a general tool called a holographic transformation, which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In this work, the holographic transformation is generalized to q... | 28 | arxiv cs it | Title: holographic transformation for quantum factor graphs. Abstract: Recently, a general tool called a holographic transformation, which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In ... |
28 | 1,573,599,372 | Title: rooted trees with probabilities revisited | Abstract: Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average Node-Sum Interchange Theorem (LANSIT) and the well-known applications to ... | 28 | arxiv cs it | Title: rooted trees with probabilities revisited. Abstract: Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average Node-Sum Interchange Th... |
29 | 1,578,902,217 | Title: time critical social mobilization | Abstract: The World Wide Web is commonly seen as a platform that can harness the collective abilities of large numbers of people to accomplish tasks with unprecedented speed, accuracy, and scale. To explore the Web’s ability for social mobilization, the Defense Advanced Research Projects Agency (DARPA) held the DARPA N... | 3 | arxiv cs cy | Title: time critical social mobilization. Abstract: The World Wide Web is commonly seen as a platform that can harness the collective abilities of large numbers of people to accomplish tasks with unprecedented speed, accuracy, and scale. To explore the Web’s ability for social mobilization, the Defense Advanced Researc... |
30 | 1,581,827,225 | Title: homomorphic encryption theory and application | Abstract: The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications. After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography. The fundamental theories of homomorphic encryption are then discussed with... | 4 | arxiv cs cr | Title: homomorphic encryption theory and application. Abstract: The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications. After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography. The fundamental theo... |
31 | 1,585,744,708 | Title: learning transformations for clustering and classification | Abstract: A low-rank transformation learning framework for subspace clustering and classification is here proposed. Many high-dimensional data, such as face images and motion sequences, approximately lie in a union of low-dimensional subspaces. The corresponding subspace clustering problem has been extensively studied ... | 16 | arxiv cs cv | Title: learning transformations for clustering and classification. Abstract: A low-rank transformation learning framework for subspace clustering and classification is here proposed. Many high-dimensional data, such as face images and motion sequences, approximately lie in a union of low-dimensional subspaces. The corr... |
32 | 1,586,330,215 | Title: methods for integrating knowledge with the three weight optimization algorithm for hybrid cognitive processing | Abstract: In this paper we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit knowledge to improve solution speed and quality. In this context, we focus on the Three-Weight Algorithm, which aims to solve general optimizati... | 10 | arxiv cs ai | Title: methods for integrating knowledge with the three weight optimization algorithm for hybrid cognitive processing. Abstract: In this paper we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit knowledge to improve solu... |
33 | 1,591,405,962 | Title: csma local area networking under dynamic altruism | Abstract: In this paper, we consider medium access control of local area networks (LANs) under limitedinformation conditions as befits a distributed system. Rather than assuming “by rule” conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a noncooperative game framewo... | 8 | arxiv cs ni | Title: csma local area networking under dynamic altruism. Abstract: In this paper, we consider medium access control of local area networks (LANs) under limitedinformation conditions as befits a distributed system. Rather than assuming “by rule” conformance to a protocol designed to regulate packet-flow rates (e.g., CS... |
34 | 1,595,098,738 | Title: face frontalization for alignment and recognition | Abstract: Recently, it was shown that excellent results can be achieved in both face landmark localization and pose-invariant face recognition. These breakthroughs are attributed to the efforts of the community to manually annotate facial images in many different poses and to collect 3D faces data. In this paper, we pr... | 16 | arxiv cs cv | Title: face frontalization for alignment and recognition. Abstract: Recently, it was shown that excellent results can be achieved in both face landmark localization and pose-invariant face recognition. These breakthroughs are attributed to the efforts of the community to manually annotate facial images in many differen... |
35 | 1,596,723,206 | Title: from bounded affine types to automatic timing analysis | Abstract: Bounded linear types have proved to be useful for automated resource analysis and control in functional programming languages. In this paper we introduce an affine bounded linear typing discipline on a general notion of resource which can be modeled in a semiring. For this type system we provide both a genera... | 22 | arxiv cs pl | Title: from bounded affine types to automatic timing analysis. Abstract: Bounded linear types have proved to be useful for automated resource analysis and control in functional programming languages. In this paper we introduce an affine bounded linear typing discipline on a general notion of resource which can be model... |
36 | 1,601,434,380 | Title: an efficient way to perform the assembly of finite element matrices in matlab and octave | Abstract: We describe different optimization techniques to perform the assembly of finite element matrices in Matlab and Octave, from the standard approach to recent vectorized ones, without any low level language used. We finally obtain a simple and efficient vectorized algorithm able to compete in performance with de... | 0 | arxiv cs na | Title: an efficient way to perform the assembly of finite element matrices in matlab and octave. Abstract: We describe different optimization techniques to perform the assembly of finite element matrices in Matlab and Octave, from the standard approach to recent vectorized ones, without any low level language used. We ... |
37 | 1,606,458,877 | Title: how auto encoders could provide credit assignment in deep networks via target propagation | Abstract: We propose to exploit {\em reconstruction} as a layer-local training signal for deep learning. Reconstructions can be propagated in a form of target propagation playing a role similar to back-propagation but helping to reduce the reliance on derivatives in order to perform credit assignment across many levels... | 24 | arxiv cs lg | Title: how auto encoders could provide credit assignment in deep networks via target propagation. Abstract: We propose to exploit {\em reconstruction} as a layer-local training signal for deep learning. Reconstructions can be propagated in a form of target propagation playing a role similar to back-propagation but help... |
38 | 1,607,460,189 | Title: constrained parametric proposals and pooling methods for semantic segmentation in rgb d images | Abstract: We focus on the problem of semantic segmentation based on RGB-D data, with emphasis on analyzing cluttered indoor scenes containing many instances from many visual categories. Our approach is based on a parametric figure-ground intensity and depth-constrained proposal process that generates spatial layout hyp... | 16 | arxiv cs cv | Title: constrained parametric proposals and pooling methods for semantic segmentation in rgb d images. Abstract: We focus on the problem of semantic segmentation based on RGB-D data, with emphasis on analyzing cluttered indoor scenes containing many instances from many visual categories. Our approach is based on a para... |
39 | 1,615,334,113 | Title: cooperative game theoretic solution concepts for top k problems | Abstract: The problem of finding the $k$ most critical nodes, referred to as the $top\text{-}k$ problem, is a very important one in several contexts such as information diffusion and preference aggregation in social networks, clustering of data points, etc. It has been observed in the literature that the value allotted... | 26 | arxiv cs si | Title: cooperative game theoretic solution concepts for top k problems. Abstract: The problem of finding the $k$ most critical nodes, referred to as the $top\text{-}k$ problem, is a very important one in several contexts such as information diffusion and preference aggregation in social networks, clustering of data poi... |
40 | 1,618,900,328 | Title: regulation and the integrity of spreadsheets in the information supply chain | Abstract: Spreadsheets provide many of the key links between information systems, closing the gap between business needs and the capability of central systems. Recent regulations have brought these vulnerable parts of information supply chains into focus. The risk they present to the organisation depends on the role th... | 3 | arxiv cs cy | Title: regulation and the integrity of spreadsheets in the information supply chain. Abstract: Spreadsheets provide many of the key links between information systems, closing the gap between business needs and the capability of central systems. Recent regulations have brought these vulnerable parts of information suppl... |
41 | 1,623,729,836 | Title: reconfigurable wireless networks | Abstract: Driven by the advent of sophisticated and ubiquitous applications, and the ever-growing need for information, wireless networks are without a doubt steadily evolving into profoundly more complex and dynamic systems. The user demands are progressively rampant, while application requirements continue to expand ... | 8 | arxiv cs ni | Title: reconfigurable wireless networks. Abstract: Driven by the advent of sophisticated and ubiquitous applications, and the ever-growing need for information, wireless networks are without a doubt steadily evolving into profoundly more complex and dynamic systems. The user demands are progressively rampant, while app... |
42 | 1,633,846,131 | Title: contact representations of sparse planar graphs | Abstract: We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2,k)-sparse if every s-vertex subgraph has at mo... | 20 | arxiv cs cg | Title: contact representations of sparse planar graphs. Abstract: We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A gr... |
43 | 1,634,869,392 | Title: modularity aspects of disjunctive stable models | Abstract: Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where fully declarative and nonmonotonic languages are applied. In this conte... | 2 | arxiv cs lo | Title: modularity aspects of disjunctive stable models. Abstract: Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where fully declarati... |
44 | 1,650,363,355 | Title: replica symmetric bound for restricted isometry constant | Abstract: We develop a method for evaluating restricted isometry constants (RICs). This evaluation is reduced to the identification of the zero-points of entropy, which is defined for submatrices that are composed of columns selected from a given measurement matrix. Using the replica method developed in statistical mec... | 28 | arxiv cs it | Title: replica symmetric bound for restricted isometry constant. Abstract: We develop a method for evaluating restricted isometry constants (RICs). This evaluation is reduced to the identification of the zero-points of entropy, which is defined for submatrices that are composed of columns selected from a given measurem... |
45 | 1,657,294,604 | Title: pushdown abstractions of javascript | Abstract: We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by starting from an established reduction semantics for JavaScript and systematically deriving its intensional abstract interpretation. Ou... | 22 | arxiv cs pl | Title: pushdown abstractions of javascript. Abstract: We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by starting from an established reduction semantics for JavaScript and systematically deriving... |
46 | 1,661,863,441 | Title: a notion of robustness for cyber physical systems | Abstract: Robustness as a system property describes the degree to which a system is able to function correctly in the presence of disturbances, i.e., unforeseen or erroneous inputs. In this paper, we introduce a notion of robustness termed input-output dynamical stability for cyber-physical systems (CPS) which merges... | 19 | arxiv cs sy | Title: a notion of robustness for cyber physical systems. Abstract: Robustness as a system property describes the degree to which a system is able to function correctly in the presence of disturbances, i.e., unforeseen or erroneous inputs. In this paper, we introduce a notion of robustness termed input-output dynamica... |
47 | 1,665,243,225 | Title: entropy rate for hidden markov chains with rare transitions | Abstract: We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is reduced to zero. Let (Xn) be a Markov chain with finite state space S and ... | 28 | arxiv cs it | Title: entropy rate for hidden markov chains with rare transitions. Abstract: We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is reduce... |
48 | 1,665,669,548 | Title: memristors can implement fuzzy logic | Abstract: In our work we propose implementing fuzzy logic using memristors. Min and max operations are done by antipodally configured memristor circuits that may be assembled into computational circuits. We discuss computational power of such circuits with respect to m-efficiency and experimentally observed behavior of... | 18 | arxiv cs et | Title: memristors can implement fuzzy logic. Abstract: In our work we propose implementing fuzzy logic using memristors. Min and max operations are done by antipodally configured memristor circuits that may be assembled into computational circuits. We discuss computational power of such circuits with respect to m-effic... |
49 | 1,667,633,038 | Title: asymptotic capacity of wireless ad hoc networks with realistic links under a honey comb topology | Abstract: We consider the effects of Rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. New bounds are derived for the capacity of a given random ad hoc wireless network that reflect packet drop or capture probability of the tra... | 28 | arxiv cs it | Title: asymptotic capacity of wireless ad hoc networks with realistic links under a honey comb topology. Abstract: We consider the effects of Rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. New bounds are derived for the capa... |
50 | 1,670,829,281 | Title: on the performance of selection cooperation with imperfect channel estimation | Abstract: In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplifyand-forward protocol over frequency flat fading channels. I n the selection scheme, only the “best” relay wh... | 28 | arxiv cs it | Title: on the performance of selection cooperation with imperfect channel estimation. Abstract: In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplifyand-forward protocol o... |
51 | 1,681,484,497 | Title: informetric analyses of knowledge organization systems koss | Abstract: A knowledge organization system (KOS) is made up of concepts and semantic relations between the concepts which represent a knowledge domain terminologically. We distinguish between five approaches to KOSs: nomenclatures, classification systems, thesauri, ontologies and, as a borderline case of KOSs, folksonom... | 38 | arxiv cs dl | Title: informetric analyses of knowledge organization systems koss. Abstract: A knowledge organization system (KOS) is made up of concepts and semantic relations between the concepts which represent a knowledge domain terminologically. We distinguish between five approaches to KOSs: nomenclatures, classification system... |
52 | 1,682,705,844 | Title: latent topic models for hypertext | Abstract: Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collection such as the Internet, there has also been great interest in extending these approaches to hypertext [6, 9]. These approaches ty... | 31 | arxiv cs ir | Title: latent topic models for hypertext. Abstract: Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collection such as the Internet, there has also been great interest in extending these approache... |
53 | 1,698,782,162 | Title: complete security framework for wireless sensor networks | Abstract: Security concern for a Sensor Networks and level of security desired may differ according to application specific needs where the sensor networks are deployed. Till now, most of the security solutions proposed for sensor networks are layer wise i.e a particular solution is applicable to single layer itself. S... | 4 | arxiv cs cr | Title: complete security framework for wireless sensor networks. Abstract: Security concern for a Sensor Networks and level of security desired may differ according to application specific needs where the sensor networks are deployed. Till now, most of the security solutions proposed for sensor networks are layer wise ... |
54 | 1,717,093,152 | Title: neural dissimilarity indices that predict oddball detection in behaviour | Abstract: Neuroscientists have recently shown that images that are difficult to find in visual search elicit similar patterns of firing across a population of recorded neurons. The $L^{1}$ distance between firing rate vectors associated with two images was strongly correlated with the inverse of decision time in behavi... | 28 | arxiv cs it | Title: neural dissimilarity indices that predict oddball detection in behaviour. Abstract: Neuroscientists have recently shown that images that are difficult to find in visual search elicit similar patterns of firing across a population of recorded neurons. The $L^{1}$ distance between firing rate vectors associated wi... |
55 | 1,720,451,657 | Title: network maps of technology fields a comparative analysis of relatedness measures | Abstract: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping. Constructing such a network requires a measure of the relatedness between pairs of technology fields. Despite the existence of various relatedness measures in the literature, it is u... | 26 | arxiv cs si | Title: network maps of technology fields a comparative analysis of relatedness measures. Abstract: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping. Constructing such a network requires a measure of the relatedness between pairs of technology... |
56 | 1,738,519,518 | Title: continuous double auction mechanism and bidding strategies in cloud computing markets | Abstract: Cloud computing has been an emerging model which aims at allowing customers to utilize computing resources hosted by Cloud Service Providers (CSPs). More and more consumers rely on CSPs to supply computing and storage service on the one hand, and CSPs try to attract consumers on favorable terms on the other. ... | 5 | arxiv cs dc | Title: continuous double auction mechanism and bidding strategies in cloud computing markets. Abstract: Cloud computing has been an emerging model which aims at allowing customers to utilize computing resources hosted by Cloud Service Providers (CSPs). More and more consumers rely on CSPs to supply computing and storag... |
57 | 1,740,018,295 | Title: the abc problem for gabor systems | Abstract: A Gabor system generated by a window function $\phi$ and a rectangular lattice $a \Z\times \Z/b$ is given by $${\mathcal G}(\phi, a \Z\times \Z/b):=\{e^{-2\pi i n t/b} \phi(t- m a):\ (m, n)\in \Z\times \Z\}.$$ One of fundamental problems in Gabor analysis is to identify window functions $\phi$ and time-freque... | 28 | arxiv cs it | Title: the abc problem for gabor systems. Abstract: A Gabor system generated by a window function $\phi$ and a rectangular lattice $a \Z\times \Z/b$ is given by $${\mathcal G}(\phi, a \Z\times \Z/b):=\{e^{-2\pi i n t/b} \phi(t- m a):\ (m, n)\in \Z\times \Z\}.$$ One of fundamental problems in Gabor analysis is to identi... |
58 | 1,754,384,483 | Title: inference less density estimation using copula bayesian networks | Abstract: We consider learning continuous probabilistic graphical models in the face of missing data. For non-Gaussian models, learning the parameters and structure of such models depends on our ability to perform efficient inference, and can be prohibitive even for relatively modest domains. Recently, we introduced th... | 24 | arxiv cs lg | Title: inference less density estimation using copula bayesian networks. Abstract: We consider learning continuous probabilistic graphical models in the face of missing data. For non-Gaussian models, learning the parameters and structure of such models depends on our ability to perform efficient inference, and can be p... |
59 | 1,769,594,948 | Title: optimal detection of intersections between convex polyhedra | Abstract: For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so that given two preprocessed polyhedra $P$ and $Q$ in $\mathbb{R}^d$, eac... | 20 | arxiv cs cg | Title: optimal detection of intersections between convex polyhedra. Abstract: For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so that... |
60 | 1,774,345,111 | Title: limits of rush hour logic complexity | Abstract: Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space computation, using certain car configurations as building blocks... | 9 | arxiv cs cc | Title: limits of rush hour logic complexity. Abstract: Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space computation, using ... |
61 | 1,777,784,767 | Title: new separation between s f and bs f | Abstract: In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$. | 9 | arxiv cs cc | Title: new separation between s f and bs f. Abstract: In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$. |
62 | 1,791,983,455 | Title: a survey on handover management in mobility architectures | Abstract: This work presents a comprehensive and structured taxonomy of available techniques for managing the handover process in mobility architectures. Representative works from the existing literature have been divided into appropriate categories, based on their ability to support horizontal handovers, vertical hand... | 8 | arxiv cs ni | Title: a survey on handover management in mobility architectures. Abstract: This work presents a comprehensive and structured taxonomy of available techniques for managing the handover process in mobility architectures. Representative works from the existing literature have been divided into appropriate categories, bas... |
63 | 1,798,241,237 | Title: many task computing and blue waters | Abstract: This report discusses many-task computing (MTC) generically and in the context of the proposed Blue Waters systems, which is planned to be the largest NSF-funded supercomputer when it begins production use in 2012. The aim of this report is to inform the BW project about MTC, including understanding aspects o... | 5 | arxiv cs dc | Title: many task computing and blue waters. Abstract: This report discusses many-task computing (MTC) generically and in the context of the proposed Blue Waters systems, which is planned to be the largest NSF-funded supercomputer when it begins production use in 2012. The aim of this report is to inform the BW project ... |
64 | 1,812,070,052 | Title: identifying reliable annotations for large scale image segmentation | Abstract: Challenging computer vision tasks, in particular semantic image segmentation, require large training sets of annotated images. While obtaining the actual images is often unproblematic, creating the necessary annotation is a tedious and costly process. Therefore, one often has to work with unreliable annotatio... | 16 | arxiv cs cv | Title: identifying reliable annotations for large scale image segmentation. Abstract: Challenging computer vision tasks, in particular semantic image segmentation, require large training sets of annotated images. While obtaining the actual images is often unproblematic, creating the necessary annotation is a tedious an... |
65 | 1,814,471,488 | Title: improved analysis for subspace pursuit algorithm in terms of restricted isometry constant | Abstract: In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery complexity greatly comparing with the well-known $\ell_1$-minimization. Restricted isometry property ... | 28 | arxiv cs it | Title: improved analysis for subspace pursuit algorithm in terms of restricted isometry constant. Abstract: In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery com... |
66 | 1,815,334,329 | Title: squares of 3 sun free split graphs | Abstract: AbstractThesquareofagraphG,denotedbyG 2 ,isobtainedfromGbyputtinganedge between twodistinct verticeswhenevertheirdistanceis two. ThenG is called a square root of G 2 . Deciding whether a given graph has asquarerootisknowntobeNP-complete,eveniftherootisrequiredtobeasplit graph,thatis,agraphinwhichthevertexsetc... | 9 | arxiv cs cc | Title: squares of 3 sun free split graphs. Abstract: AbstractThesquareofagraphG,denotedbyG 2 ,isobtainedfromGbyputtinganedge between twodistinct verticeswhenevertheirdistanceis two. ThenG is called a square root of G 2 . Deciding whether a given graph has asquarerootisknowntobeNP-complete,eveniftherootisrequiredtobeasp... |
67 | 1,816,985,167 | Title: tree dynamics for peer to peer streaming | Abstract: This paper presents an asynchronous distributed algorithm to manage multiple trees for peer-to-peer streaming in a flow level model. It is assumed that videos are cut into substreams, with or without source coding, to be distributed to all nodes. The algorithm guarantees that each node receives sufficiently m... | 34 | arxiv cs ds | Title: tree dynamics for peer to peer streaming. Abstract: This paper presents an asynchronous distributed algorithm to manage multiple trees for peer-to-peer streaming in a flow level model. It is assumed that videos are cut into substreams, with or without source coding, to be distributed to all nodes. The algorithm ... |
68 | 1,818,292,367 | Title: stochastic ordering of interferences in large scale wireless networks | Abstract: Stochastic orders are binary relations defined on probability distributions which capture intuitive notions like being larger or being more variable. This paper introduces stochastic ordering of interference distributions in large-scale networks modeled as point process. Interference is the main performance-l... | 28 | arxiv cs it | Title: stochastic ordering of interferences in large scale wireless networks. Abstract: Stochastic orders are binary relations defined on probability distributions which capture intuitive notions like being larger or being more variable. This paper introduces stochastic ordering of interference distributions in large-s... |
69 | 1,818,296,812 | Title: earthquake disaster based efficient resource utilization technique in iaas cloud | Abstract: Cloud Computing is an emerging area. The main aim of the initial search-and-rescue period after strong earthquakes is to reduce the whole number of mortalities. One main trouble rising in this period is to and the greatest assignment of available resources to functioning zones. For this issue a dynamic optimi... | 5 | arxiv cs dc | Title: earthquake disaster based efficient resource utilization technique in iaas cloud. Abstract: Cloud Computing is an emerging area. The main aim of the initial search-and-rescue period after strong earthquakes is to reduce the whole number of mortalities. One main trouble rising in this period is to and the greates... |
70 | 1,823,940,520 | Title: on descriptional complexity of the planarity problem for gauss words | Abstract: In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can involve knot diagrams with arbitrarily many crossings then Gauss words ... | 33 | arxiv cs fl | Title: on descriptional complexity of the planarity problem for gauss words. Abstract: In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knot... |
71 | 1,824,996,543 | Title: multi access mimo systems with finite rate channel state feedback | Abstract: This paper characterizes the effect of finite rate channel state feedback on the sum rate of a multi-access multiple-input multiple-output (MIMO) system. We propose to control the users jointly, specifically, we first choose the users jointly and then select the corresponding beamforming vectors jointly. To q... | 28 | arxiv cs it | Title: multi access mimo systems with finite rate channel state feedback. Abstract: This paper characterizes the effect of finite rate channel state feedback on the sum rate of a multi-access multiple-input multiple-output (MIMO) system. We propose to control the users jointly, specifically, we first choose the users j... |
72 | 1,831,933,153 | Title: an information theoretic perspective of the poisson approximation via the chen stein method | Abstract: The first part of this work considers the entropy of the sum of ( possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of this entropy by the entropy of a Poisson random variable with the same mean are derived via the Chen... | 28 | arxiv cs it | Title: an information theoretic perspective of the poisson approximation via the chen stein method. Abstract: The first part of this work considers the entropy of the sum of ( possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of ... |
73 | 1,838,670,769 | Title: a set and collection lemma | Abstract: A set S is independent if no two vertices from S are adjacent. In this paper we prove that if F is a collection of maximum independent sets of a graph, then there is a matching from S-{intersection of all members of F} into {union of all members of F}-S, for every independent set S. Based on this finding we g... | 39 | arxiv cs dm | Title: a set and collection lemma. Abstract: A set S is independent if no two vertices from S are adjacent. In this paper we prove that if F is a collection of maximum independent sets of a graph, then there is a matching from S-{intersection of all members of F} into {union of all members of F}-S, for every independen... |
74 | 1,839,164,722 | Title: learning economic parameters from revealed preferences | Abstract: A recent line of work, starting with Beigman and Vohra (2006) and Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a utility function from revealed preference data. The goal here is to make use of past data describing the purchases of a utility maximizing agent when faced with certai... | 36 | arxiv cs gt | Title: learning economic parameters from revealed preferences. Abstract: A recent line of work, starting with Beigman and Vohra (2006) and Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a utility function from revealed preference data. The goal here is to make use of past data describing the... |
75 | 1,844,261,290 | Title: towards adapting imagenet to reality scalable domain adaptation with implicit low rank transformations | Abstract: Images seen during test time are often not from the same distribution as images used for learning. This problem, known as domain shift, occurs when training classifiers from object-centric internet image databases and trying to apply them directly to scene understanding tasks. The consequence is often severe ... | 16 | arxiv cs cv | Title: towards adapting imagenet to reality scalable domain adaptation with implicit low rank transformations. Abstract: Images seen during test time are often not from the same distribution as images used for learning. This problem, known as domain shift, occurs when training classifiers from object-centric internet i... |
76 | 1,849,650,586 | Title: using multiple criteria methods to evaluate community partitions | Abstract: Community detection is one of the most studied problems on complex networks. Although hundreds of methods have been proposed so far, there is still no universally accepted formal definition of what is a good community. As a consequence, the problem of the evaluation and the comparison of the quality of the so... | 26 | arxiv cs si | Title: using multiple criteria methods to evaluate community partitions. Abstract: Community detection is one of the most studied problems on complex networks. Although hundreds of methods have been proposed so far, there is still no universally accepted formal definition of what is a good community. As a consequence, ... |
77 | 1,852,713,323 | Title: incremental adaptation strategies for neural network language models | Abstract: It is today acknowledged that neural network language models outperform backoff language models in applications like speech recognition or statistical machine translation. However, training these models on large amounts of data can take several days. We present efficient techniques to adapt a neural network l... | 13 | arxiv cs ne | Title: incremental adaptation strategies for neural network language models. Abstract: It is today acknowledged that neural network language models outperform backoff language models in applications like speech recognition or statistical machine translation. However, training these models on large amounts of data can t... |
78 | 1,856,665,498 | Title: optimal point to point codes in interference channels an incremental i mmse approach | Abstract: A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with receiver, assuming that the interfered-with transmission is an optimal ... | 28 | arxiv cs it | Title: optimal point to point codes in interference channels an incremental i mmse approach. Abstract: A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference an... |
79 | 1,859,168,105 | Title: a combined approach for constraints over finite domains and arrays | Abstract: Arrays are ubiquitous in the context of software verication. However, eective reasoning over arrays is still rare in CP, as local reasoning is dramatically ill-conditioned for constraints over arrays. In this paper, we propose an approach com- bining both global symbolic reasoning and local consistency lterin... | 2 | arxiv cs lo | Title: a combined approach for constraints over finite domains and arrays. Abstract: Arrays are ubiquitous in the context of software verication. However, eective reasoning over arrays is still rare in CP, as local reasoning is dramatically ill-conditioned for constraints over arrays. In this paper, we propose an appro... |
80 | 1,860,769,804 | Title: optimization design and analysis of systematic lt codes over awgn channel | Abstract: In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding algorithm. Similar to low-density parity-check codes, Gaussian approximatio... | 28 | arxiv cs it | Title: optimization design and analysis of systematic lt codes over awgn channel. Abstract: In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) de... |
81 | 1,867,927,193 | Title: truth and envy in capacitated allocation games | Abstract: We study auctions with additive valuations where agents have a limit on the number of items they may receive. We refer to this setting as capacitated allocation games. We seek truthful and envy free mechanisms that maximize the social welfare. I.e., where agents have no incentive to lie and no agent seeks to ... | 36 | arxiv cs gt | Title: truth and envy in capacitated allocation games. Abstract: We study auctions with additive valuations where agents have a limit on the number of items they may receive. We refer to this setting as capacitated allocation games. We seek truthful and envy free mechanisms that maximize the social welfare. I.e., where... |
82 | 1,869,518,888 | Title: smt based bounded model checking of fixed point digital controllers | Abstract: Digital controllers have several advantages with respect to their flexibility and design's simplicity. However, they are subject to problems that are not faced by analog controllers. In particular, these problems are related to the finite word-length implementation that might lead to overflows, limit cycles, ... | 19 | arxiv cs sy | Title: smt based bounded model checking of fixed point digital controllers. Abstract: Digital controllers have several advantages with respect to their flexibility and design's simplicity. However, they are subject to problems that are not faced by analog controllers. In particular, these problems are related to the fi... |
83 | 1,871,136,127 | Title: google matrix of business process management | Abstract: Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identified by the modeler and the link direction indicates ... | 3 | arxiv cs cy | Title: google matrix of business process management. Abstract: Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identi... |
End of preview.
README.md exists but content is empty.
- Downloads last month
- 324