Sciweavers

13987 search results - page 377 / 2798
» The Two Guards Problem
Sort
View
154
Voted
AAECC
2004
Springer
87views Algorithms» more  AAECC 2004»
15 years 6 months ago
DFT-based Word Normalization in Finite Supersolvable Groups
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
Meinard Müller, Michael Clausen
IPL
2000
146views more  IPL 2000»
15 years 6 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
MOC
2000
75views more  MOC 2000»
15 years 6 months ago
Multihomogeneous Newton methods
Abstract. We study multihomogeneous analytic functions and a multihomogeneous Newton's method for finding their zeros. We give a convergence result for this iteration and we s...
Jean-Pierre Dedieu, Mike Shub
JMLR
2012
13 years 9 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 7 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...