453 search results - page 87 / 91 » Tight bounds for the partial-sums problem |
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
WONS
2005
IEEE
15 years 5 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
100
click to vote
IWDC
2005
Springer
15 years 5 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
105
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
IJCAI
2007
15 years 1 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...