1629 search results - page 207 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
AIPS
2004
14 years 11 months ago
2004
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
ISLPED
2010
ACM
14 years 10 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
AUIC
2005
IEEE
15 years 3 months ago
2005
IEEE
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...