Sciweavers

1763 search results - page 108 / 353
» Dependent random choice
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
JSAC
2008
112views more  JSAC 2008»
13 years 9 months ago
System Design Considerations for Undersea Networks: Link and Multiple Access Protocols
Abstract--We address several inter-related aspects of underwater network design within the context of a cross-layer approach. We first highlight the impact of key characteristics o...
Nathan Parrish, Leonard T. Tracy, Sumit Roy, Payma...
PERVASIVE
2006
Springer
13 years 9 months ago
The Diet-Aware Dining Table: Observing Dietary Behaviors over a Tabletop Surface
We are what we eat. Our everyday food choices affect our long-term and short-term health. In the traditional health care, professionals assess and weigh each individual's diet...
Keng-hao Chang, Shih-yen Liu, Hao-Hua Chu, Jane Yu...
TOG
2008
111views more  TOG 2008»
13 years 9 months ago
Clone attack! Perception of crowd variety
When simulating large crowds, it is inevitable that the models and motions of many virtual characters will be cloned. However, the perceptual impact of this trade-off has never be...
Rachel McDonnell, Michéal Larkin, Simon Dob...
GLOBECOM
2008
IEEE
14 years 3 months ago
A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
Ravi Tandon, Sennur Ulukus