Sciweavers

3894 search results - page 479 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SIAMSC
2008
147views more  SIAMSC 2008»
15 years 4 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
INFOCOM
2010
IEEE
15 years 2 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
14 years 8 hour ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
WWW
2008
ACM
16 years 5 months ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
INFOCOM
2007
IEEE
15 years 10 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...