Sciweavers

794 search results - page 6 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ALT
2011
Springer
14 years 6 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
DAM
2008
109views more  DAM 2008»
15 years 6 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
ICWS
2007
IEEE
15 years 7 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
AAAI
1998
15 years 7 months ago
An Algebra for Cyclic Ordering of 2D Orientations
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
Amar Isli, Anthony G. Cohn
IPL
2002
118views more  IPL 2002»
15 years 5 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot