Sciweavers

4047 search results - page 454 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
MFCS
2005
Springer
16 years 6 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
167
Voted
WIDM
2003
ACM
15 years 12 months ago
Clustering documents in a web directory
Hierarchical categorization of documents is a task receiving growing interest due to the widespread proliferation of topic hierarchies for text documents. The worst problem of hie...
Giordano Adami, Paolo Avesani, Diego Sona
COLT
1998
Springer
15 years 11 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
COR
2011
15 years 1 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
DMGT
2011
94views more  DMGT 2011»
14 years 10 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...