Sciweavers

2430 search results - page 292 / 486
» Computing Tutte Polynomials
Sort
View
ICTCS
2005
Springer
15 years 9 months ago
Inapproximability Results for the Lateral Gene Transfer Problem
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakr...
114
Voted
ISMIS
2005
Springer
15 years 9 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
115
Voted
MFCS
2005
Springer
15 years 9 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
153
Voted
WINE
2005
Springer
206views Economy» more  WINE 2005»
15 years 9 months ago
Exchange Market Equilibria with Leontief's Utility: Freedom of Pricing Leads to Rationality
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
Yinyu Ye
95
Voted
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 9 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee