1629 search results - page 287 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
110
click to vote
BNCOD
2009
15 years 27 days ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
132
click to vote
JSAC
2010
14 years 6 months ago
2010
Abstract--Sensor networks can benefit greatly from locationawareness, since it allows information gathered by the sensors to be tied to their physical locations. Ultra-wide bandwid...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
173
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
As information becomes available in increasing amounts to a wide spectrum of users, the need for a shift towards a more user-centered information access paradigm arises. We develo...
VLSID
2002
IEEE
16 years 5 days ago
2002
IEEE
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...