Sciweavers

129
Voted
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 9 days ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
97
Voted
IJCAI
2001
15 years 9 days ago
Distributed Monitoring of Hybrid Systems: A model-directed approach
This paper presents an efficient online mode estimation algorithm for a class of sensor-rich, distributed embedded systems, the so-called hybrid systems. A central problem in dist...
Feng Zhao, Xenofon D. Koutsoukos, Horst W. Haussec...
IJCAI
2001
15 years 9 days ago
Reinforcement Learning in Distributed Domains: Beyond Team Games
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
David Wolpert, Joseph Sill, Kagan Tumer
MASCOTS
2004
15 years 9 days ago
Predicting When Not to Predict
File prefetching based on previous file access patterns has been shown to be an effective means of reducing file system latency by implicitly loading caches with files that are li...
Karl Brandt, Darrell D. E. Long, Ahmed Amer
83
Voted
LWA
2004
15 years 9 days ago
Learning Prototype Ontologies by Hierachical Latent Semantic Analysis
An ontology is a speci...cation of a conceptualization, a shared understanding of some domain of interest. The paper develops an algorithm that hierarchically groups words together...
Gerhard Paaß, Jörg Kindermann, Edda Leo...
86
Voted
IJCAI
2001
15 years 9 days ago
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
HIS
2001
15 years 9 days ago
A Bayesian Track-before-Detect Algorithm for IR Point Target Detection
An algorithm has been developed for the detection of point targets in uncluttered background based on a Bayesian track before detect method. The algorithm has an application in th...
Robert C. Warren
79
Voted
DLOG
2003
15 years 9 days ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
110
Voted
DICTA
2003
15 years 9 days ago
Globally Optimal Surfaces by Continuous Maximal Flows
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Ben Appleton, Hugues Talbot
79
Voted
FLAIRS
2001
15 years 9 days ago
Time Series Analysis Using Unsupervised Construction of Hierarchical Classifiers
Recently we have proposed an algorithm of constructing hierarchical neural network classifiers (HNNC), that is based on a modification of error back-propagation. This algorithm co...
S. A. Dolenko, Yu. V. Orlov, I. G. Persiantsev, Ju...