1322 search results - page 185 / 265 » Parameterized counting problems |
127
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
133
Voted
BROADNETS
2007
IEEE
15 years 10 months ago
2007
IEEE
-- In this paper, we propose DATALITE, a Distributed Architecture for Traffic Analysis via LIghtweight Traffic digEst, which introduces a set of new distributed algorithms and prot...
117
Voted
MMM
2007
Springer
15 years 10 months ago
2007
Springer
The aim of this work is to devise an effective method for static summarization of home video sequences. Based on the premise that the user watching a summary is interested in peop...
110
Voted
AUSDM
2007
Springer
15 years 10 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
169
Voted
ILP
2007
Springer
15 years 9 months ago
2007
Springer
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...