Sciweavers

13414 search results - page 2663 / 2683
» The distributed boosting algorithm
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
SAC
2008
ACM
13 years 8 months ago
Knowledge-based semantic clustering
Users of the web are increasingly interested in tracking the appearance of new postings rather than locating existing knowledge. Coupled with this is the emergence of the Web 2.0 ...
John Keeney, Dominic Jones, Dominik Roblek, David ...
BIRTHDAY
2010
Springer
13 years 7 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
CIKM
2010
Springer
13 years 7 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CIKM
2010
Springer
13 years 7 months ago
A structured approach to query recommendation with social annotation data
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
Jiafeng Guo, Xueqi Cheng, Gu Xu, Huawei Shen
« Prev « First page 2663 / 2683 Last » Next »