Sciweavers

1074 search results - page 120 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
COLT
2000
Springer
15 years 2 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
15 years 2 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
EMNLP
2008
14 years 11 months ago
Soft-Supervised Learning for Text Classification
We propose a new graph-based semisupervised learning (SSL) algorithm and demonstrate its application to document categorization. Each document is represented by a vertex within a ...
Amarnag Subramanya, Jeff Bilmes
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law