Sciweavers

16404 search results - page 126 / 3281
» A set coverage problem
Sort
View
INFOCOM
2011
IEEE
14 years 6 months ago
Optimal multiple-coverage of sensor networks
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Biao Chen, Wei Z...
BMCBI
2007
102views more  BMCBI 2007»
15 years 3 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
ICTAI
2005
IEEE
15 years 8 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
AMW
2009
15 years 4 months ago
Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...
Ali Kiani, Nematollaah Shiri
LREC
2008
125views Education» more  LREC 2008»
15 years 4 months ago
I saw TREE trees in the park: How to Correct Real-Word Spelling Mistakes
This paper presents a context sensitive spell checking system that uses mixed trigram models, and introduces a new empirically grounded method for building confusion sets. The pro...
Davide Fossati, Barbara Di Eugenio