Sciweavers

1888 search results - page 280 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
WWW
2003
ACM
14 years 9 months ago
Improving pseudo-relevance feedback in web information retrieval using web page segmentation
In contrast to traditional document retrieval, a web page as a whole is not a good information unit to search because it often contains multiple topics and a lot of irrelevant inf...
Shipeng Yu, Deng Cai, Ji-Rong Wen, Wei-Ying Ma
DAGSTUHL
2004
13 years 10 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
TALG
2010
110views more  TALG 2010»
13 years 7 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
PREMI
2011
Springer
13 years 9 hour ago
Finding Potential Seeds through Rank Aggregation of Web Searches
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
Rajendra Prasath, Pinar Öztürk
JCST
2007
151views more  JCST 2007»
13 years 9 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng