808 search results - page 145 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
PLANX
2008
13 years 8 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...