Sciweavers

IWPEC
2010
Springer
13 years 10 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
FOCS
2010
IEEE
13 years 10 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
EMNLP
2010
13 years 10 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
ACL
2010
13 years 10 months ago
A Latent Dirichlet Allocation Method for Selectional Preferences
The computation of selectional preferences, the admissible argument values for a relation, is a well-known NLP task with broad applicability. We present LDA-SP, which utilizes Lin...
Alan Ritter, Mausam, Oren Etzioni
JCSS
2010
114views more  JCSS 2010»
13 years 10 months ago
FPT algorithms and kernels for the Directed k-Leaf problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
Jean Daligault, Gregory Gutin, Eun Jung Kim, Ander...
EJC
2008
13 years 10 months ago
Locating sensors in paths and cycles: The case of 2-identifying codes
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
David L. Roberts, Fred S. Roberts
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 10 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan
COMPSEC
2010
93views more  COMPSEC 2010»
13 years 10 months ago
A secure peer-to-peer backup service keeping great autonomy while under the supervision of a provider
Making backup is so cumbersome and expensive that individuals hardly ever backup their data and companies usually duplicate their data into a secondary server. This paper proposes...
Houssem Jarraya, Maryline Laurent
NECO
2007
127views more  NECO 2007»
13 years 11 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
JCNS
2002
74views more  JCNS 2002»
13 years 11 months ago
States of High Conductance in a Large-Scale Model of the Visual Cortex
This paper reports on the consequences of large, activity dependent, synaptic conductances for neurons in a large-scale neuronal network model of the input layer 4C of the Macaque ...
Michael Shelley, David McLaughlin, Robert Shapley,...