5100 search results - page 767 / 1020 » The Linear Complexity of a Graph |
171
click to vote
AFRIGRAPH
2003
ACM
15 years 10 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
167
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
151
click to vote
JAIR
2006
15 years 6 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
206
click to vote
CSUR
1999
15 years 6 months ago
1999
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
234
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...