1629 search results - page 27 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
118
click to vote
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
FPL
2008
Springer
14 years 11 months ago
2008
Springer
Exploiting the underutilisation of variable-length DSP algorithms during normal operation is vital, when seeking to maximise the achievable functionality of an application within ...
EDBT
2006
ACM
15 years 9 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...
DATE
2006
IEEE
15 years 1 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
181
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...