Sciweavers

1283 search results - page 76 / 257
» Probabilistic structured query methods
Sort
View
MICAI
2004
Springer
14 years 2 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
TREC
2004
13 years 10 months ago
Indri at TREC 2004: Terabyte Track
This paper provides an overview of experiments carried out at the TREC 2004 Terabyte Track using the Indri search engine. Indri is an efficient, effective distributed search engin...
Donald Metzler, Trevor Strohman, Howard R. Turtle,...
OOPSLA
2007
Springer
14 years 3 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 10 months ago
Accelerating Profile Queries in Elevation Maps
Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe re...
Feng Pan, Wei Wang 0010, Leonard McMillan
IPM
2008
155views more  IPM 2008»
13 years 8 months ago
Determining the informational, navigational, and transactional intent of Web queries
In this paper, we define and present a comprehensive classification of user intent for Web searching. The classification consists of three hierarchical levels of informational, na...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink