Sciweavers

248 search results - page 44 / 50
» On the Cayley isomorphism problem
Sort
View
CCS
2003
ACM
14 years 2 months ago
Learning attack strategies from intrusion alerts
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
Peng Ning, Dingbang Xu
CVPR
2000
IEEE
14 years 2 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 11 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
IEE
2008
115views more  IEE 2008»
13 years 9 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
ECCC
2006
70views more  ECCC 2006»
13 years 9 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas