Sciweavers

3367 search results - page 460 / 674
» Incremental assignment problem
Sort
View
WSDM
2012
ACM
252views Data Mining» more  WSDM 2012»
13 years 11 months ago
WebSets: extracting sets of entities from the web using unsupervised information extraction
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
Bhavana Bharat Dalvi, William W. Cohen, Jamie Call...
177
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Maximizing capacity with power control under physical interference model in duplex mode
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, ...
ATAL
2009
Springer
15 years 10 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
INFOCOM
2008
IEEE
15 years 10 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
INFOCOM
2006
IEEE
15 years 10 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee