Sciweavers

4908 search results - page 279 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
EDBT
2006
ACM
150views Database» more  EDBT 2006»
15 years 10 months ago
A Framework for Distributed XML Data Management
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
Serge Abiteboul, Ioana Manolescu, Emanuel Taropa
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
Coordinated Beamforming for the Multiuser MIMO Broadcast Channel With Limited Feedforward
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
BMCBI
2011
14 years 10 months ago
Biomarker Discovery and Redundancy Reduction towards Classification using a Multi-factorial MALDI-TOF MS T2DM Mouse Model Datase
Background: Diabetes like many diseases and biological processes is not mono-causal. On the one hand multifactorial studies with complex experimental design are required for its c...
Chris Bauer, Frank Kleinjung, Celia J. Smith, Mark...
COMPGEOM
2004
ACM
16 years 3 days ago
On lines avoiding unit balls in three dimensions
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
AIPS
2003
15 years 8 months ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü