2562 search results - page 195 / 513 » Components of the Fundamental Category |
219
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
186
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
176
click to vote
CIKM
2009
Springer
15 years 10 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...
168
click to vote
EMNETS
2007
15 years 10 months ago
2007
Designing Wireless Sensor Networks (WSNs) has proven to be a slow, tedious and error-prone process due to the inherent intricacies of designing a distributed, wireless, and embedd...
191
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...