Sciweavers

671 search results - page 106 / 135
» Research proposal for distributed deep web search
Sort
View
IIWAS
2008
15 years 1 months ago
Application framework with demand-driven mashup for selective browsing
Abstract: We are developing a new mashup framework for creating flexible applications in which users can selectively browse through mashup items. The framework provides GUI compone...
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
115
Voted
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 7 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
201
Voted
CIKM
2011
Springer
14 years 14 days ago
Focusing on novelty: a crawling strategy to build diverse language models
Word prediction performed by language models has an important role in many tasks as e.g. word sense disambiguation, speech recognition, hand-writing recognition, query spelling an...
Luciano Barbosa, Srinivas Bangalore
CSR
2007
Springer
15 years 6 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
93
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 18 days 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...