412 search results - page 70 / 83 » Ranked Join Indices |
APPROX
2011
Springer
12 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
ICDE
2009
IEEE
15 years 19 days ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...
MSR
2006
ACM
14 years 4 months ago
2006
ACM
Software birthmarks are unique and native characteristics of every software component. Two components having similar birthmarks indicate that they are similar in functionality, st...
INFOCOM
2002
IEEE
14 years 3 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...