Sciweavers

639 search results - page 96 / 128
» Dominance Constraints with Set Operators
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
14 years 9 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
DAS
2010
Springer
15 years 2 months ago
Analysis of whole-book recognition
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
Pingping Xiu, Henry S. Baird
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 4 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
FIW
1998
130views Communications» more  FIW 1998»
14 years 11 months ago
A Heuristic Approach to Detect Feature Interactions in Requirements
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...
Maritta Heisel, Jeanine Souquières
INFOCOM
2008
IEEE
15 years 4 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano