Sciweavers

Share
ICASSP
2011
IEEE
7 years 8 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan
APWEB
2011
Springer
7 years 11 months ago
Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
Haiming Chen, Ping Lu
CORR
2010
Springer
145views Education» more  CORR 2010»
8 years 1 months ago
Outer Bounds for the Interference Channel with a Cognitive Relay
In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages t...
Stefano Rini, Daniela Tuninetti, Natasha Devroye
NAACL
2010
8 years 2 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
FSTTCS
2010
Springer
8 years 2 months ago
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
Sven Schewe
COLT
2010
Springer
8 years 2 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
SIROCCO
2010
8 years 2 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
JAIR
2007
111views more  JAIR 2007»
8 years 4 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
TALG
2008
124views more  TALG 2008»
8 years 4 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
SIAMDM
2008
99views more  SIAMDM 2008»
8 years 4 months ago
Hat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
Steve Butler, Mohammad Taghi Hajiaghayi, Robert D....
books