450 search results - page 18 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
100
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
COLING
1992
15 years 1 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
120
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
111
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...