1322 search results - page 185 / 265 » Parameterized counting problems |
150
click to vote
FSTTCS
2009
Springer
16 years 16 days 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...
158
click to vote
BROADNETS
2007
IEEE
16 years 9 days 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...
148
click to vote
MMM
2007
Springer
16 years 7 days 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...
138
click to vote
AUSDM
2007
Springer
16 years 4 days 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 ...
211
click to vote
ILP
2007
Springer
16 years 3 days 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...