—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
— It has for long been recognized that in multi-cell wide-band code division multiple access (WCDMA) networks the admission of a new session into the system can have undesirable ...
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...