4411 search results - page 745 / 883 » Communication Complexity and Its Applications |
152
Voted
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper presents a bottom-up tracking algorithm for surveillance applications where speed and reliability in the case of multiple matches and occlusions are major concerns. The...
180
Voted
AAAI
2010
15 years 1 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
143
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
171
Voted
CCR
2011
14 years 12 months ago
2011
While analyzing CAIDA Internet traces of TCP traffic to detect instances of data reneging, we frequently observed seven misbehaviors in the generation of SACKs. These misbehaviors...
168
click to vote
PRL
2010
14 years 11 months ago
2010
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...