Sciweavers

447 search results - page 70 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
IDA
2002
Springer
13 years 8 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
PODS
2010
ACM
197views Database» more  PODS 2010»
13 years 8 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
14 years 5 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 2 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
JCO
2006
234views more  JCO 2006»
13 years 8 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid