id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0909.0777 | Optimally Tuned Iterative Reconstruction Algorithms for Compressed
Sensing | cs.NA cs.IT cs.MS math.IT | We conducted an extensive computational experiment, lasting multiple
CPU-years, to optimally select parameters for two important classes of
algorithms for finding sparse solutions of underdetermined systems of linear
equations. We make the optimally tuned implementations available at {\tt
sparselab.stanford.edu}; the... |
0909.0801 | A Monte Carlo AIXI Approximation | cs.AI cs.IT cs.LG math.IT | This paper introduces a principled approach for the design of a scalable
general reinforcement learning agent. Our approach is based on a direct
approximation of AIXI, a Bayesian optimality notion for general reinforcement
learning agents. Previously, it has been unclear whether the theory of AIXI
could motivate the ... |
0909.0809 | An Infinite Family of Recursive Formulas Generating Power Moments of
Kloosterman Sums with Trace One Arguments: O(2n+1,2^r) Case | math.NT cs.IT math.IT | In this paper, we construct an infinite family of binary linear codes
associated with double cosets with respect to certain maximal parabolic
subgroup of the orthogonal group O(2n+1,q). Here q is a power of two. Then we
obtain an infinite family of recursive formulas generating the odd power
moments of Kloosterman su... |
0909.0811 | Ternary Codes Associated with O^-(2n,q) and Power Moments of Kloosterman
Sums with Square Arguments | math.NT cs.IT math.IT | In this paper, we construct three ternary linear codes associated with the
orthogonal group O^-(2,q) and the special orthogonal groups SO^-(2,q) and
SO^-(4,q). Here q is a power of three. Then we obtain recursive formulas for
the power moments of Kloosterman sums with square arguments and for the even
power moments o... |
0909.0844 | High-Dimensional Non-Linear Variable Selection through Hierarchical
Kernel Learning | cs.LG math.ST stat.TH | We consider the problem of high-dimensional non-linear variable selection for
supervised learning. Our approach is based on performing linear selection among
exponentially many appropriately defined positive definite kernels that
characterize non-linear interactions between the original variables. To select
efficient... |
0909.0901 | Assessing the Impact of Informedness on a Consultant's Profit | cs.AI | We study the notion of informedness in a client-consultant setting. Using a
software simulator, we examine the extent to which it pays off for consultants
to provide their clients with advice that is well-informed, or with advice that
is merely meant to appear to be well-informed. The latter strategy is
beneficial in... |
0909.0996 | The Kalman Like Particle Filter : Optimal Estimation With Quantized
Innovations/Measurements | cs.IT math.IT math.OC | We study the problem of optimal estimation and control of linear systems
using quantized measurements, with a focus on applications over sensor
networks. We show that the state conditioned on a causal quantization of the
measurements can be expressed as the sum of a Gaussian random vector and a
certain truncated Gaus... |
0909.1011 | Bits About the Channel: Multi-round Protocols for Two-way Fading
Channels | cs.IT math.IT | Most communication systems use some form of feedback, often related to
channel state information. In this paper, we study diversity multiplexing
tradeoff for both FDD and TDD systems, when both receiver and transmitter
knowledge about the channel is noisy and potentially mismatched. For FDD
systems, we first extend t... |
0909.1021 | A multiagent urban traffic simulation Part I: dealing with the ordinary | cs.AI | We describe in this article a multiagent urban traffic simulation, as we
believe individual-based modeling is necessary to encompass the complex
influence the actions of an individual vehicle can have on the overall flow of
vehicles. We first describe how we build a graph description of the network
from purely geomet... |
0909.1062 | New Approximation Algorithms for Minimum Enclosing Convex Shapes | cs.CG cs.DS cs.LG | Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing
Ball (MEB) problem is to find the ball with the smallest radius which contains
all $n$ points. We give a $O(nd\Qcal/\sqrt{\epsilon})$ approximation algorithm
for producing an enclosing ball whose radius is at most $\epsilon$ away from
the op... |
0909.1115 | Capacity Region of Layered Erasure One-sided Interference Channels
without CSIT | cs.IT math.IT | This paper studies a layered erasure interference channel model, which is a
simplification of the Gaussian interference channel with fading using the
deterministic model approach. In particular, the capacity region of the layered
erasure one-sided interference channel is completely determined, assuming that
the chann... |
0909.1127 | Anonymization with Worst-Case Distribution-Based Background Knowledge | cs.DB cs.CR | Background knowledge is an important factor in privacy preserving data
publishing. Distribution-based background knowledge is one of the well studied
background knowledge. However, to the best of our knowledge, there is no
existing work considering the distribution-based background knowledge in the
worst case scenari... |
0909.1147 | Empowering OLAC Extension using Anusaaraka and Effective text processing
using Double Byte coding | cs.CL | The paper reviews the hurdles while trying to implement the OLAC extension
for Dravidian / Indian languages. The paper further explores the possibilities
which could minimise or solve these problems. In this context, the Chinese
system of text processing and the anusaaraka system are scrutinised.
|
0909.1151 | n-Opposition theory to structure debates | cs.AI | 2007 was the first international congress on the ?square of oppositions?. A
first attempt to structure debate using n-opposition theory was presented along
with the results of a first experiment on the web. Our proposal for this paper
is to define relations between arguments through a structure of opposition
(square ... |
0909.1153 | Recursive formulas generating power moments of multi-dimensional
Kloosterman sums and $m$-multiple power moments of Kloosterman sums | math.NT cs.IT math.IT | In this paper, we construct two binary linear codes associated with
multi-dimensional and $m -$multiple power Kloosterman sums (for any fixed $m$)
over the finite field $\mathbb{F}_{q}$. Here $q$ is a power of two. The former
codes are dual to a subcode of the binary hyper-Kloosterman code. Then we
obtain two recursi... |
0909.1156 | Ternary Codes Associated with $O(3,3^r)$ and Power Moments of
Kloosterman Sums with Trace Nonzero Square Arguments | math.NT cs.IT math.IT | In this paper, we construct two ternary linear codes $C(SO(3,q))$ and
$C(O(3,q))$, respectively associated with the orthogonal groups $SO(3,q)$ and
$O(3,q)$. Here $q$ is a power of three. Then we obtain two recursive formulas
for the power moments of Kloosterman sums with $``$trace nonzero square
arguments" in terms ... |
0909.1175 | Infinite Families of Recursive Formulas Generating Power Moments of
Ternary Kloosterman Sums with Trace Nonzero Square Arguments: $O(2n+1,2^{r})$
Case | math.NT cs.IT math.IT | In this paper, we construct four infinite families of ternary linear codes
associated with double cosets in $O(2n+1,q)$ with respect to certain maximal
parabolic subgroup of the special orthogonal group $SO(2n+1,q)$. Here $q$ is a
power of three. Then we obtain two infinite families of recursive formulas, the
one gen... |
0909.1178 | Infinite Families of Recursive Formulas Generating Power Moments of
Ternary Kloosterman Sums with Square Arguments Associated with
$O^{-}_{}(2n,q)$ | math.NT cs.IT math.IT | In this paper, we construct eight infinite families of ternary linear codes
associated with double cosets with respect to certain maximal parabolic
subgroup of the special orthogonal group $SO^{-}(2n,q)$. Here ${q}$ is a power
of three. Then we obtain four infinite families of recursive formulas for power
moments of ... |
0909.1186 | Scheme of thinking quantum systems | quant-ph cond-mat.quant-gas cs.AI | A general approach describing quantum decision procedures is developed. The
approach can be applied to quantum information processing, quantum computing,
creation of artificial quantum intelligence, as well as to analyzing decision
processes of human decision makers. Our basic point is to consider an active
quantum s... |
0909.1209 | SNR Estimation in Maximum Likelihood Decoded Spatial Multiplexing | cs.IT math.IT | Link adaptation is a crucial part of many modern communications systems,
allowing the system to adapt the transmission and reception strategies to
changes in channel conditions. One of the fundamental components of the link
adaptation mechanism is signal to noise ratio (SNR) estimation, measuring the
instantaneous (m... |
0909.1308 | Efficient Learning of Sparse Conditional Random Fields for Supervised
Sequence Labelling | cs.LG cs.CL | Conditional Random Fields (CRFs) constitute a popular and efficient approach
for supervised sequence labelling. CRFs can cope with large description spaces
and can integrate some form of structural dependency between labels. In this
contribution, we address the issue of efficient feature selection for CRFs
based on i... |
0909.1310 | Sparse image representation by discrete cosine/spline based dictionaries | math.NA cs.CV | Mixed dictionaries generated by cosine and B-spline functions are considered.
It is shown that, by highly nonlinear approaches such as Orthogonal Matching
Pursuit, the discrete version of the proposed dictionaries yields a significant
gain in the sparsity of an image representation.
|
0909.1334 | Lower Bounds for BMRM and Faster Rates for Training SVMs | cs.LG cs.AI cs.DS | Regularized risk minimization with the binary hinge loss and its variants
lies at the heart of many machine learning problems. Bundle methods for
regularized risk minimization (BMRM) and the closely related SVMStruct are
considered the best general purpose solvers to tackle this problem. It was
recently shown that BM... |
0909.1338 | "Rewiring" Filterbanks for Local Fourier Analysis: Theory and Practice | cs.IT math.IT | This article describes a series of new results outlining equivalences between
certain "rewirings" of filterbank system block diagrams, and the corresponding
actions of convolution, modulation, and downsampling operators. This gives rise
to a general framework of reverse-order and convolution subband structures in
fil... |
0909.1344 | Multiuser MISO Transmitter Optimization for Inter-Cell Interference
Mitigation | cs.IT math.IT | The transmitter optimization (i.e., steering vectors and power allocation)
for a MISO Broadcast Channel (MISO-BC) subject to general linear constraints is
considered. Such constraints include, as special cases, the sum power, the
per-antenna or per-group-of-antennas power, and "forbidden interference
direction" const... |
0909.1346 | Reordering Columns for Smaller Indexes | cs.DB | Column-oriented indexes-such as projection or bitmap indexes-are compressed
by run-length encoding to reduce storage and increase speed. Sorting the tables
improves compression. On realistic data sets, permuting the columns in the
right order before sorting can reduce the number of runs by a factor of two or
more. Un... |
0909.1397 | Resource Matchmaking Algorithm using Dynamic Rough Set in Grid
Environment | cs.DC cs.AI | Grid environment is a service oriented infrastructure in which many
heterogeneous resources participate to provide the high performance
computation. One of the bug issues in the grid environment is the vagueness and
uncertainty between advertised resources and requested resources. Furthermore,
in an environment such ... |
0909.1405 | A Hybrid Multi Objective Particle Swarm Optimization Method to Discover
Biclusters in Microarray Data | cs.CE cs.NE | In recent years, with the development of microarray technique, discovery of
useful knowledge from microarray data has become very important. Biclustering
is a very useful data mining technique for discovering genes which have similar
behavior. In microarray data, several objectives have to be optimized
simultaneously... |
0909.1426 | L^p boundedness of the Hilbert transform | cs.IT math.IT | The Hilbert transform is essentially the \textit{only} singular operator in
one dimension. This undoubtedly makes it one of the the most important linear
operators in harmonic analysis. The Hilbert transform has had a profound
bearing on several theoretical and physical problems across a wide range of
disciplines; th... |
0909.1460 | Accuracy Improvement for Stiffness Modeling of Parallel Manipulators | cs.RO | The paper focuses on the accuracy improvement of stiffness models for
parallel manipulators, which are employed in high-speed precision machining. It
is based on the integrated methodology that combines analytical and numerical
techniques and deals with multidimensional lumped-parameter models of the
links. The latte... |
0909.1475 | Design optimization of parallel manipulators for high-speed precision
machining applications | cs.RO | The paper proposes an integrated approach to the design optimization of
parallel manipulators, which is based on the concept of the workspace grid and
utilizes the goal-attainment formulation for the global optimization. To
combine the non-homogenous design specification, the developed optimization
technique transfor... |
0909.1525 | Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for
Relay Networks | cs.IT math.IT | Recently, a special class of complex designs called Training-Embedded Complex
Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol
Maximum Likelihood (ML) decodable (SSD) distributed space-time block codes
(DSTBCs) for two-hop wireless relay networks using the amplify and forward
protocol. Howe... |
0909.1599 | Frame Permutation Quantization | cs.IT math.IT | Frame permutation quantization (FPQ) is a new vector quantization technique
using finite frames. In FPQ, a vector is encoded using a permutation source
code to quantize its frame expansion. This means that the encoding is a partial
ordering of the frame expansion coefficients. Compared to ordinary permutation
source ... |
0909.1605 | Kernel Spectral Curvature Clustering (KSCC) | cs.CV | Multi-manifold modeling is increasingly used in segmentation and data
representation tasks in computer vision and related fields. While the general
problem, modeling data by mixtures of manifolds, is very challenging, several
approaches exist for modeling data by mixtures of affine subspaces (which is
often referred ... |
0909.1608 | Motion Segmentation by SCC on the Hopkins 155 Database | cs.CV | We apply the Spectral Curvature Clustering (SCC) algorithm to a benchmark
database of 155 motion sequences, and show that it outperforms all other
state-of-the-art methods. The average misclassification rate by SCC is 1.41%
for sequences having two motions and 4.85% for three motions.
|
0909.1623 | Two channel paraunitary filter banks based on linear canonical transform | cs.IT math.IT | In this paper a two channel paraunitary filter bank is proposed, which is
based on linear canonical transform, instead of discrete Fourier transform.
Input-output relation for such a filter bank are derived in terms of polyphase
matrices and modulation matrices. It is shown that like conventional filter
banks, the LC... |
0909.1626 | Computing the distance distribution of systematic non-linear codes | cs.DM cs.IT math.IT | The most important families of non-linear codes are systematic. A brute-force
check is the only known method to compute their weight distribution and
distance distribution. On the other hand, it outputs also all closest word
pairs in the code. In the black-box complexity model, the check is optimal
among closest-pair... |
0909.1638 | Single-generation Network Coding for Networks with Delay | cs.IT math.IT | A single-source network is said to be \textit{memory-free} if all of the
internal nodes (those except the source and the sinks) do not employ memory but
merely send linear combinations of the incoming symbols (received at their
incoming edges) on their outgoing edges. Memory-free networks with delay using
network cod... |
0909.1758 | Teaching an Old Elephant New Tricks | cs.DB cs.DS cs.PF | In recent years, column stores (or C-stores for short) have emerged as a
novel approach to deal with read-mostly data warehousing applications.
Experimental evidence suggests that, for certain types of queries, the new
features of C-stores result in orders of magnitude improvement over traditional
relational engines.... |
0909.1759 | Declarative Reconfigurable Trust Management | cs.CR cs.DB | In recent years, there has been a proliferation of declarative logic-based
trust management languages and systems proposed to ease the description,
configuration, and enforcement of security policies. These systems have
different tradeoffs in expressiveness and complexity, depending on the security
constructs (e.g. a... |
0909.1760 | LifeRaft: Data-Driven, Batch Processing for the Exploration of
Scientific Databases | cs.DB | Workloads that comb through vast amounts of data are gaining importance in
the sciences. These workloads consist of "needle in a haystack" queries that
are long running and data intensive so that query throughput limits
performance. To maximize throughput for data-intensive queries, we put forth
LifeRaft: a query pro... |
0909.1763 | Remembrance: The Unbearable Sentience of Being Digital | cs.DB cs.OS | We introduce a world vision in which data is endowed with memory. In this
data-centric systems paradigm, data items can be enabled to retain all or some
of their previous values. We call this ability "remembrance" and posit that it
empowers significant leaps in the security, availability, and general
operational dime... |
0909.1764 | Data Management for High-Throughput Genomics | cs.DB q-bio.GN | Today's sequencing technology allows sequencing an individual genome within a
few weeks for a fraction of the costs of the original Human Genome project.
Genomics labs are faced with dozens of TB of data per week that have to be
automatically processed and made available to scientists for further analysis.
This paper... |
0909.1765 | Qunits: queried units in database search | cs.DB cs.IR | Keyword search against structured databases has become a popular topic of
investigation, since many users find structured queries too hard to express,
and enjoy the freedom of a ``Google-like'' query box into which search terms
can be entered. Attempts to address this problem face a fundamental dilemma.
Database quer... |
0909.1766 | RIOT: I/O-Efficient Numerical Computing without SQL | cs.DB | R is a numerical computing environment that is widely popular for statistical
data analysis. Like many such environments, R performs poorly for large
datasets whose sizes exceed that of physical memory. We present our vision of
RIOT (R with I/O Transparency), a system that makes R programs I/O-efficient in
a way tran... |
0909.1767 | Towards Eco-friendly Database Management Systems | cs.DB | Database management systems (DBMSs) have largely ignored the task of managing
the energy consumed during query processing. Both economical and environmental
factors now require that DBMSs pay close attention to energy consumption. In
this paper we approach this issue by considering energy consumption as a
first-class... |
0909.1768 | Unbundling Transaction Services in the Cloud | cs.DB cs.DC | The traditional architecture for a DBMS engine has the recovery, concurrency
control and access method code tightly bound together in a storage engine for
records. We propose a different approach, where the storage engine is factored
into two layers (each of which might have multiple heterogeneous instances). A
Trans... |
0909.1769 | Interactive Data Integration through Smart Copy & Paste | cs.DB cs.AI | In many scenarios, such as emergency response or ad hoc collaboration, it is
critical to reduce the overhead in integrating data. Ideally, one could perform
the entire process interactively under one unified interface: defining
extractors and wrappers for sources, creating a mediated schema, and adding
schema mapping... |
0909.1770 | From Declarative Languages to Declarative Processing in Computer Games | cs.DB cs.MA | Recent work has shown that we can dramatically improve the performance of
computer games and simulations through declarative processing: Character AI can
be written in an imperative scripting language which is then compiled to
relational algebra and executed by a special games engine with features similar
to a main m... |
0909.1771 | The Role of Schema Matching in Large Enterprises | cs.DB | To date, the principal use case for schema matching research has been as a
precursor for code generation, i.e., constructing mappings between schema
elements with the end goal of data transfer. In this paper, we argue that
schema matching plays valuable roles independent of mapping construction,
especially as schemat... |
0909.1772 | Visualizing the robustness of query execution | cs.DB cs.PF | In database query processing, actual run-time conditions (e.g., actual
selectivities and actual available memory) very often differ from compile-time
expectations of run-time conditions (e.g., estimated predicate selectivities
and anticipated memory availability). Robustness of query processing can be
defined as the ... |
0909.1773 | Search Driven Analysis of Heterogenous XML Data | cs.DB | Analytical processing on XML repositories is usually enabled by designing
complex data transformations that shred the documents into a common data
warehousing schema. This can be very time-consuming and costly, especially if
the underlying XML data has a lot of variety in structure, and only a subset of
attributes co... |
0909.1774 | Social Systems: Can we Do More Than Just Poke Friends? | cs.DB cs.CY | Social sites have become extremely popular among users but have they
attracted equal attention from the research community? Are they good only for
simple tasks, such as tagging and poking friends? Do they present any new or
interesting research challenges? In this paper, we describe the insights we
have obtained impl... |
0909.1775 | SCADS: Scale-Independent Storage for Social Computing Applications | cs.DB cs.DC | Collaborative web applications such as Facebook, Flickr and Yelp present new
challenges for storing and querying large amounts of data. As users and
developers are focused more on performance than single copy consistency or the
ability to perform ad-hoc queries, there exists an opportunity for a
highly-scalable syste... |
0909.1776 | Sailing the Information Ocean with Awareness of Currents: Discovery and
Application of Source Dependence | cs.DB cs.LG | The Web has enabled the availability of a huge amount of useful information,
but has also eased the ability to spread false information and rumors across
multiple sources, making it hard to distinguish between what is true and what
is not. Recent examples include the premature Steve Jobs obituary, the second
bankrupt... |
0909.1777 | Capturing Data Uncertainty in High-Volume Stream Processing | cs.DB | We present the design and development of a data stream system that captures
data uncertainty from data collection to query processing to final result
generation. Our system focuses on data that is naturally modeled as continuous
random variables. For such data, our system employs an approach grounded in
probability a... |
0909.1778 | A Case for A Collaborative Query Management System | cs.DB | Over the past 40 years, database management systems (DBMSs) have evolved to
provide a sophisticated variety of data management capabilities. At the same
time, tools for managing queries over the data have remained relatively
primitive. One reason for this is that queries are typically issued through
applications. The... |
0909.1779 | The Case for RodentStore, an Adaptive, Declarative Storage System | cs.DB | Recent excitement in the database community surrounding new
applications?analytic, scientific, graph, geospatial, etc.?has led to an
explosion in research on database storage systems. New storage systems are
vital to the database community, as they are at the heart of making database
systems perform well in new appli... |
0909.1781 | Boosting XML Filtering with a Scalable FPGA-based Architecture | cs.AR cs.DB | The growing amount of XML encoded data exchanged over the Internet increases
the importance of XML based publish-subscribe (pub-sub) and content based
routing systems. The input in such systems typically consists of a stream of
XML documents and a set of user subscriptions expressed as XML queries. The
pub-sub system... |
0909.1782 | Principles for Inconsistency | cs.DB | Data consistency is very desirable because strong semantic properties make it
easier to write correct programs that perform as users expect. However, there
are good reasons why consistency may have to be weakened to achieve other
business goals. In this CIDR 2009 Perspectives paper, we present real-world
reasons inco... |
0909.1783 | The Case for a Structured Approach to Managing Unstructured Data | cs.DB cs.IR | The challenge of managing unstructured data represents perhaps the largest
data management opportunity for our community since managing relational data.
And yet we are risking letting this opportunity go by, ceding the playing field
to other players, ranging from communities such as AI, KDD, IR, Web, and
Semantic Web... |
0909.1784 | Energy Efficiency: The New Holy Grail of Data Management Systems
Research | cs.DB cs.PF | Energy costs are quickly rising in large-scale data centers and are soon
projected to overtake the cost of hardware. As a result, data center operators
have recently started turning into using more energy-friendly hardware. Despite
the growing body of research in power management techniques, there has been
little wor... |
0909.1785 | Harnessing the Deep Web: Present and Future | cs.DB | Over the past few years, we have built a system that has exposed large
volumes of Deep-Web content to Google.com users. The content that our system
exposes contributes to more than 1000 search queries per-second and spans over
50 languages and hundreds of domains. The Deep Web has long been acknowledged
to be a major... |
0909.1786 | DBMSs Should Talk Back Too | cs.DB cs.HC | Natural language user interfaces to database systems have been studied for
several decades now. They have mainly focused on parsing and interpreting
natural language queries to generate them in a formal database language. We
envision the reverse functionality, where the system would be able to take the
internal resul... |
0909.1801 | Randomized Sensor Selection in Sequential Hypothesis Testing | cs.IT math.IT | We consider the problem of sensor selection for time-optimal detection of a
hypothesis. We consider a group of sensors transmitting their observations to a
fusion center. The fusion center considers the output of only one randomly
chosen sensor at the time, and performs a sequential hypothesis test. We
consider the c... |
0909.1817 | Cooperative Transmission for a Vector Gaussian Parallel Relay Network | cs.IT math.IT | In this paper, we consider a parallel relay network where two relays
cooperatively help a source transmit to a destination. We assume the source and
the destination nodes are equipped with multiple antennas. Three basic schemes
and their achievable rates are studied: Decode-and-Forward (DF),
Amplify-and-Forward (AF),... |
0909.1830 | Greedy Gossip with Eavesdropping | cs.DC cs.AI | This paper presents greedy gossip with eavesdropping (GGE), a novel
randomized gossip algorithm for distributed computation of the average
consensus problem. In gossip algorithms, nodes in the network randomly
communicate with their neighbors and exchange information iteratively. The
algorithms are simple and decentr... |
0909.1933 | Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and
Stationary $\beta$-Mixing Processes | cs.LG math.ST stat.ML stat.TH | Pac-Bayes bounds are among the most accurate generalization bounds for
classifiers learned from independently and identically distributed (IID) data,
and it is particularly so for margin classifiers: there have been recent
contributions showing how practical these bounds can be either to perform model
selection (Ambr... |
0909.2009 | A Fresh Look at Coding for q-ary Symmetric Channels | cs.IT math.IT | This paper studies coding schemes for the $q$-ary symmetric channel based on
binary low-density parity-check (LDPC) codes that work for any alphabet size
$q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed
packet-based schemes requiring large $q$. First, theoretical optimality of a
simple layered sch... |
0909.2017 | Sparsity and `Something Else': An Approach to Encrypted Image Folding | cs.CV cs.IT math.IT | A property of sparse representations in relation to their capacity for
information storage is discussed. It is shown that this feature can be used for
an application that we term Encrypted Image Folding. The proposed procedure is
realizable through any suitable transformation. In particular, in this paper we
illustra... |
0909.2030 | Size Bounds for Conjunctive Queries with General Functional Dependencies | cs.DB cs.DS | This paper extends the work of Gottlob, Lee, and Valiant (PODS 2009)[GLV],
and considers worst-case bounds for the size of the result Q(D) of a
conjunctive query Q to a database D given an arbitrary set of functional
dependencies. The bounds in [GLV] are based on a "coloring" of the query
variables. In order to exten... |
0909.2058 | SocialScope: Enabling Information Discovery on Social Content Sites | cs.DB cs.HC cs.IR cs.PL | Recently, many content sites have started encouraging their users to engage
in social activities such as adding buddies on Yahoo! Travel and sharing
articles with their friends on New York Times. This has led to the emergence of
{\em social content sites}, which is being facilitated by initiatives like
OpenID (http:/... |
0909.2062 | Inter-Operator Feedback in Data Stream Management Systems via
Punctuation | cs.DB | High-volume, high-speed data streams may overwhelm the capabilities of stream
processing systems; techniques such as data prioritization, avoidance of
unnecessary processing and on-demand result production may be necessary to
reduce processing requirements. However, the dynamic nature of data streams, in
terms of bot... |
0909.2074 | Sum Capacity of MIMO Interference Channels in the Low Interference
Regime | cs.IT math.IT | Using Gaussian inputs and treating interference as noise at the receivers has
recently been shown to be sum capacity achieving for the two-user single-input
single-output (SISO) Gaussian interference channel in a low interference
regime, where the interference levels are below certain thresholds. In this
paper, such ... |
0909.2091 | Paired Comparisons-based Interactive Differential Evolution | cs.AI | We propose Interactive Differential Evolution (IDE) based on paired
comparisons for reducing user fatigue and evaluate its convergence speed in
comparison with Interactive Genetic Algorithms (IGA) and tournament IGA. User
interface and convergence performance are two big keys for reducing Interactive
Evolutionary Com... |
0909.2194 | Approximate Nearest Neighbor Search through Comparisons | cs.DS cs.DB cs.LG | This paper addresses the problem of finding the nearest neighbor (or one of
the R-nearest neighbors) of a query object q in a database of n objects. In
contrast with most existing approaches, we can only access the ``hidden'' space
in which the objects live through a similarity oracle. The oracle, given two
reference... |
0909.2234 | Universal and Composite Hypothesis Testing via Mismatched Divergence | cs.IT cs.LG math.IT math.ST stat.TH | For the universal hypothesis testing problem, where the goal is to decide
between the known null hypothesis distribution and some other unknown
distribution, Hoeffding proposed a universal test in the nineteen sixties.
Hoeffding's universal test statistic can be written in terms of
Kullback-Leibler (K-L) divergence b... |
0909.2290 | Slicing: A New Approach to Privacy Preserving Data Publishing | cs.DB cs.CR | Several anonymization techniques, such as generalization and bucketization,
have been designed for privacy preserving microdata publishing. Recent work has
shown that generalization loses considerable amount of information, especially
for high-dimensional data. Bucketization, on the other hand, does not prevent
membe... |
0909.2292 | Random Sampling Using Shannon Interpolation and Poisson Summation
Formulae | cs.IT cs.CE math.IT math.NA | This report mainly focused on the basic concepts and the recovery methods for
the random sampling. The recovery methods involve the orthogonal matching
pursuit algorithm and the gradient-based total variation strategy. In
particular, a fast and efficient observation matrix filling technique was
implemented by the cla... |
0909.2309 | Logic with Verbs | cs.AI cs.LO | The aim of this paper is to introduce a logic in which nouns and verbs are
handled together as a deductive reasoning, and also to observe the relationship
between nouns and verbs as well as between logics and conversations.
|
0909.2336 | Two-Phase Flow in Heterogeneous Media | cs.CE | In this study, we investigate the appeared complexity of two-phase flow
(air-water) in a heterogeneous soil where the supposed porous media is
non-deformable media which is under the time-dependent gas pressure. After
obtaining of governing equations and considering the capillary
pressure-saturation and permeability ... |
0909.2339 | Back analysis based on SOM-RST system | cs.AI | This paper describes application of information granulation theory, on the
back analysis of Jeffrey mine southeast wall Quebec. In this manner, using a
combining of Self Organizing Map (SOM) and rough set theory (RST), crisp and
rough granules are obtained. Balancing of crisp granules and sub rough granules
is render... |
0909.2345 | Weblog Clustering in Multilinear Algebra Perspective | cs.IR | This paper describes a clustering method to group the most similar and
important weblogs with their descriptive shared words by using a technique from
multilinear algebra known as PARAFAC tensor decomposition. The proposed method
first creates labeled-link network representation of the weblog datasets, where
the node... |
0909.2358 | Message Passing for Integrating and Assessing Renewable Generation in a
Redundant Power Grid | physics.soc-ph cond-mat.stat-mech cs.CE physics.data-an | A simplified model of a redundant power grid is used to study integration of
fluctuating renewable generation. The grid consists of large number of
generator and consumer nodes. The net power consumption is determined by the
difference between the gross consumption and the level of renewable generation.
The gross con... |
0909.2373 | An Efficient Secure Multimodal Biometric Fusion Using Palmprint and Face
Image | cs.CV cs.CR | Biometrics based personal identification is regarded as an effective method
for automatically recognizing, with a high confidence a person's identity. A
multimodal biometric systems consolidate the evidence presented by multiple
biometric sources and typically better recognition performance compare to
system based on... |
0909.2375 | Similarity Matching Techniques for Fault Diagnosis in Automotive
Infotainment Electronics | cs.AI | Fault diagnosis has become a very important area of research during the last
decade due to the advancement of mechanical and electrical systems in
industries. The automobile is a crucial field where fault diagnosis is given a
special attention. Due to the increasing complexity and newly added features in
vehicles, a ... |
0909.2376 | Performing Hybrid Recommendation in Intermodal Transportation-the
FTMarket System's Recommendation Module | cs.AI | Diverse recommendation techniques have been already proposed and encapsulated
into several e-business applications, aiming to perform a more accurate
evaluation of the existing information and accordingly augment the assistance
provided to the users involved. This paper reports on the development and
integration of a... |
0909.2379 | Implementation of Rule Based Algorithm for Sandhi-Vicheda Of Compound
Hindi Words | cs.CL | Sandhi means to join two or more words to coin new word. Sandhi literally
means `putting together' or combining (of sounds), It denotes all combinatory
sound-changes effected (spontaneously) for ease of pronunciation.
Sandhi-vicheda describes [5] the process by which one letter (whether single or
cojoined) is broken ... |
0909.2408 | Coordination Capacity | cs.IT math.IT | We develop elements of a theory of cooperation and coordination in networks.
Rather than considering a communication network as a means of distributing
information, or of reconstructing random processes at remote nodes, we ask what
dependence can be established among the nodes given the communication
constraints. Spe... |
0909.2476 | Design of an ultrasound-guided robotic brachytherapy needle insertion
system | cs.RO | In this paper we describe a new robotic brachytherapy needle-insertion system
that is designed to replace the template used in the manual technique. After a
brief review of existing robotic systems, we describe the requirements that we
based our design upon. A detailed description of the proposed system follows.
Our ... |
0909.2489 | PrisCrawler: A Relevance Based Crawler for Automated Data Classification
from Bulletin Board | cs.IR | Nowadays people realize that it is difficult to find information simply and
quickly on the bulletin boards. In order to solve this problem, people propose
the concept of bulletin board search engine. This paper describes the
priscrawler system, a subsystem of the bulletin board search engine, which can
automatically ... |
0909.2496 | Pavideoge: A Metadata Markup Video Structure in Video Search Engine | cs.IR | In this paper, we study the problems of video processing in video search
engine. Video has now become a very important kind of data in Internet; while
searching for video is still a challenging task due to the inner properties of
video: requiring enormous storage space, being independent, expressing
information hidde... |
0909.2526 | Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly
Shortened Perfect Codes | cs.IT math.IT | The doubly shortened perfect codes of length 13 are classified utilizing the
classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The
perfect binary one-error-correcting codes of length 15: Part I -
Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such
(13,512,3) codes. ... |
0909.2542 | Stochastic Optimization of Linear Dynamic Systems with Parametric
Uncertainties | cs.AI cs.IT math.IT | This paper describes a new approach to solving some stochastic optimization
problems for linear dynamic system with various parametric uncertainties.
Proposed approach is based on application of tensor formalism for creation the
mathematical model of parametric uncertainties. Within proposed approach
following proble... |
0909.2622 | Transmitter Optimization for Achieving Secrecy Capacity in Gaussian MIMO
Wiretap Channels | cs.IT math.IT | We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel
model, where there exists a transmitter, a legitimate receiver and an
eavesdropper, each node equipped with multiple antennas. We study the problem
of finding the optimal input covariance matrix that achieves secrecy capacity
subject to a po... |
0909.2623 | Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries | cs.DB | A major problem of unstructured P2P systems is their heavy network traffic.
This is caused mainly by high numbers of query answers, many of which are
irrelevant for users. One solution to this problem is to use Top-k queries
whereby the user can specify a limited number (k) of the most relevant answers.
In this paper... |
0909.2626 | Reference Resolution within the Framework of Cognitive Grammar | cs.CL | Following the principles of Cognitive Grammar, we concentrate on a model for
reference resolution that attempts to overcome the difficulties previous
approaches, based on the fundamental assumption that all reference (independent
on the type of the referring expression) is accomplished via access to and
restructuring... |
0909.2705 | SET: an algorithm for consistent matrix completion | cs.IT math.IT | A new algorithm, termed subspace evolution and transfer (SET), is proposed
for solving the consistent matrix completion problem. In this setting, one is
given a subset of the entries of a low-rank matrix, and asked to find one
low-rank matrix consistent with the given observations. We show that this
problem can be so... |
0909.2715 | Marking-up multiple views of a Text: Discourse and Reference | cs.CL | We describe an encoding scheme for discourse structure and reference, based
on the TEI Guidelines and the recommendations of the Corpus Encoding
Specification (CES). A central feature of the scheme is a CES-based data
architecture enabling the encoding of and access to multiple views of a
marked-up document. We descr... |
0909.2718 | A Common XML-based Framework for Syntactic Annotations | cs.CL | It is widely recognized that the proliferation of annotation schemes runs
counter to the need to re-use language resources, and that standards for
linguistic annotation are becoming increasingly mandatory. To answer this need,
we have developed a framework comprised of an abstract model for a variety of
different ann... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.