Sciweavers

519 search results - page 22 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
ICALP
2011
Springer
14 years 5 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
SIAMJO
2008
139views more  SIAMJO 2008»
15 years 1 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl
DATE
2008
IEEE
143views Hardware» more  DATE 2008»
15 years 8 months ago
Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of car...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
CDB
1997
Springer
85views Database» more  CDB 1997»
15 years 5 months ago
On Expressing Topological Connectivity in Spatial Datalog
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
Bart Kuijpers, Marc Smits
POPL
2012
ACM
13 years 9 months ago
Sound predictive race detection in polynomial time
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...
Yannis Smaragdakis, Jacob Evans, Caitlin Sadowski,...