Sciweavers

73 search results - page 11 / 15
» Almost all webs are not rank-perfect
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 25 days ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
CHI
1993
ACM
13 years 11 months ago
Hyperspeech
HTTP provides a mechanism to connect web sites. Almost all sites have a large amount of hypertext content that provides connection to other sites in the World Wide Web. The succes...
Barry Arons
FLAIRS
2007
13 years 9 months ago
Lexicon Development and POS Tagging Using a Tagged Bengali News Corpus
Lexicon development and Part of Speech (POS) tagging are very important for almost all Natural Language Processing(NLP) application areas. The rapid development of these resources...
Asif Ekbal, Sivaji Bandyopadhyay
SIGMETRICS
2008
ACM
179views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Xengine: a fast and scalable XACML policy evaluation engine
XACML has become the de facto standard for specifying access control policies for various applications, especially web services. With the explosive growth of web applications depl...
Alex X. Liu, Fei Chen, JeeHyun Hwang, Tao Xie