Sciweavers

4110 search results - page 227 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
ICMAS
2000
15 years 7 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
MOBIHOC
2006
ACM
16 years 6 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 6 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
PVLDB
2010
135views more  PVLDB 2010»
15 years 1 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
Jongwuk Lee, Seung-won Hwang