Recently, profile context-sensitive HMMs (profile-csHMMs) have been proposed which are very effective in modeling the common patterns and motifs in related symbol sequences. Pro...
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
As the Web has evolved into a data-rich repository, with the standard “page view,” current search engines are becoming increasingly inadequate for a wide range of query tasks....
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...