Sciweavers

3894 search results - page 742 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
ATAL
2003
Springer
15 years 5 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
INFORMS
1998
100views more  INFORMS 1998»
14 years 11 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
TCSV
2002
69views more  TCSV 2002»
14 years 11 months ago
Optimizing channel allocation in a unified video-on-demand system
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...
Jack Y. B. Lee
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
16 years 1 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...