11538 search results - page 2305 / 2308 » From Text to Knowledge |
114
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
120
click to vote
PODC
2012
ACM
12 years 12 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
171
click to vote
SPAA
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
109
Voted
TMC
2012
12 years 12 months ago
2012
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
101
click to vote
EDBT
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...