Sciweavers

CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 1 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 1 months ago
Load-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
Erik Saule, Erdeniz Ö. Bas, Ümit V. &Cce...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 1 months ago
Sparsity Enhanced Decision Feedback Equalization
For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational compl...
Jovana Ilic, Thomas Strohmer
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 1 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 1 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 1 months ago
Detecting Separation in Robotic and Sensor Networks
In this paper we consider the problem of monitoring detecting separation of agents from a base station in robotic and sensor networks. Such separation can be caused by mobility an...
Chenda Liao, Harshavardhan Chenji, Prabir Barooah,...
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 1 months ago
A Logical Method for Policy Enforcement over Evolving Audit Logs
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
Deepak Garg, Limin Jia, Anupam Datta
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 1 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 1 months ago
A Generalized Method for Integrating Rule-based Knowledge into Inductive Methods Through Virtual Sample Creation
Hybrid learning methods use theoretical knowledge of a domain and a set of classified examples to develop a method for classification. Methods that use domain knowledge have been ...
Ridwan Al Iqbal