Sciweavers

147 search results - page 28 / 30
» Parallel Query Processing and Edge Ranking of Graphs
Sort
View
CIKM
2008
Springer
13 years 8 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
DEBU
2010
139views more  DEBU 2010»
13 years 3 months ago
Refining Information Extraction Rules using Data Provenance
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...
Bin Liu 0002, Laura Chiticariu, Vivian Chu, H. V. ...
SIGIR
2009
ACM
14 years 14 days ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
INFOCOM
2006
IEEE
14 years 9 hour ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
FCT
2009
Springer
14 years 16 days ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad