Sciweavers

417 search results - page 70 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
CLA
2007
13 years 9 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
PODC
2012
ACM
11 years 10 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
WWW
2007
ACM
14 years 8 months ago
A large-scale evaluation and analysis of personalized search strategies
Although personalized search has been proposed for many years and many personalization strategies have been investigated, it is still unclear whether personalization is consistent...
Zhicheng Dou, Ruihua Song, Ji-Rong Wen
LATIN
2010
Springer
14 years 26 days ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 12 days 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 ...