Sciweavers

459 search results - page 21 / 92
» Detecting induced subgraphs
Sort
View
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 8 months ago
Near-Optimal Evasion of Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
KAIS
2010
139views more  KAIS 2010»
13 years 6 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICDM
2008
IEEE
123views Data Mining» more  ICDM 2008»
14 years 2 months ago
Mining Periodic Behavior in Dynamic Social Networks
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...
Mayank Lahiri, Tanya Y. Berger-Wolf
EUSFLAT
2003
104views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Expert and induced knowledge for intelligent motion analysis of ground robots
The paper describes the knowledge extraction process in the application of a fuzzy system, using expert and induced knowledge, to the detection of motion problems in ground robots...
Serge Guillaume, Luis Magdalena, Miguel Áng...
STOC
2003
ACM
87views Algorithms» more  STOC 2003»
14 years 8 months ago
The intrinsic dimensionality of graphs
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occ...
Robert Krauthgamer, James R. Lee