Sciweavers

2100 search results - page 33 / 420
» Fundamentals of the problem
Sort
View
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
TON
2002
91views more  TON 2002»
13 years 9 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
SAGA
2007
Springer
14 years 4 months ago
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
Artur Czumaj, Xin Wang
CIKM
2009
Springer
14 years 1 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
MP
2007
100views more  MP 2007»
13 years 9 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...