1399 search results - page 64 / 280 » New Algorithms for k-Center and Extensions |
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
FLAIRS
2007
13 years 11 months ago
2007
Clustering attempts to discover significant groups present in a data set. It is an unsupervised process. It is difficult to define when a clustering result is acceptable. Thus,...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
ISBI
2011
IEEE
13 years 26 days ago
2011
IEEE
Caenorhabditis elegans is an important model organism for the study of molecular mechanisms of development and disease processes, due to its well-known genome and invariant cell l...