Sciweavers

1525 search results - page 175 / 305
» Matching with Regular Constraints
Sort
View
CCS
2003
ACM
15 years 9 months ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
CVPR
1999
IEEE
16 years 6 months ago
Independent Motion: The Importance of History
We consider a problem central in aerial visual surveillance applications { detection and tracking of small, independently moving objects in long and noisy video sequences. We dire...
Robert Pless, Tomás Brodský, Yiannis...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 4 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
15 years 11 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICC
2007
IEEE
15 years 10 months ago
Utility Maximization for OFDMA Systems Over Discrete Sets
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
Chan Zhou, Gerhard Wunder, Thomas Michel