32 search results - page 4 / 7 » The Wiener Index Of Random Trees |
PVLDB
2010
14 years 7 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
150
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...