5624 search results - page 397 / 1125 » On Conditional Covering Problem |
166
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
179
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
176
Voted
IUI
2010
ACM
16 years 3 months ago
2010
ACM
One of the critical problems in natural language interfaces is the discordance between the expressions covered by the interface and those by the knowledge base. In the graph-based...
174
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Whereas lecturing is the most widely used mode of instruction, we have explored small-group learning projects to make signal processing more appealing at the University and in Eng...
166
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...