Sciweavers

243 search results - page 22 / 49
» An Iterative Method for Distributed Database Design
Sort
View
NIPS
2007
13 years 10 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
VLDB
2002
ACM
138views Database» more  VLDB 2002»
13 years 8 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 1 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 1 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
SIGMOD
2006
ACM
113views Database» more  SIGMOD 2006»
14 years 9 months ago
XPORT: extensible profile-driven overlay routing trees
XPORT is a profile-driven distributed data dissemination system that supports an extensible set of data types, profiles types, and optimization metrics. XPORT efficiently implemen...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...