Sciweavers

2925 search results - page 323 / 585
» Information Complexity of Online Problems
Sort
View
CONEXT
2008
ACM
15 years 8 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
AAAI
2010
15 years 8 months ago
Structured Parameter Elicitation
The behavior of a complex system often depends on parameters whose values are unknown in advance. To operate effectively, an autonomous agent must actively gather information on t...
Li Ling Ko, David Hsu, Wee Sun Lee, Sylvie C. W. O...
SIGKDD
2002
90views more  SIGKDD 2002»
15 years 6 months ago
Database Privacy
The emphasis in database privacy should fall on a balance between confidentiality, integrity and availability of personal data, rather than on confidentiality alone. This balance ...
Martin S. Olivier
ICASSP
2011
IEEE
14 years 10 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala