Sciweavers

2652 search results - page 242 / 531
» Privacy-preserving linear programming
Sort
View
143
Voted
IJCAI
2007
15 years 5 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 4 months ago
Inverse modeling for open boundary conditions in channel network
Abstract-- An inverse modeling problem for systems governed by first-order, hyperbolic partial differential equations subject to periodic forcing is investigated. The problem is de...
Qingfang Wu, Mohammad Rafiee, Andrew Tinka, Alexan...
ECCC
2010
89views more  ECCC 2010»
15 years 3 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
JLP
2008
92views more  JLP 2008»
15 years 3 months ago
Relational measures and integration in preference modeling
Based on a set of criteria and a measuring lattice, we introduce relational measures as generalizations of fuzzy measures. The latter have recently made their way from the interva...
Gunther Schmidt, Rudolf Berghammer
DAM
2007
85views more  DAM 2007»
15 years 3 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar