Sciweavers

6894 search results - page 252 / 1379
» Generation Problems
Sort
View
APAL
2006
63views more  APAL 2006»
15 years 6 months ago
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Abderezak Ould Houcine
KDD
2003
ACM
266views Data Mining» more  KDD 2003»
16 years 7 months ago
Applying data mining in investigating money laundering crimes
In this paper, we study the problem of applying data mining to facilitate the investigation of money laundering crimes (MLCs). We have identified a new paradigm of problems --- th...
Zhongfei (Mark) Zhang, John J. Salerno, Philip S. ...
CGO
2010
IEEE
16 years 1 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
IJAC
2010
128views more  IJAC 2010»
15 years 5 months ago
Compressed Words and Automorphisms in Fully Residually Free Groups
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Jeremy MacDonald
COCOON
2009
Springer
16 years 1 months ago
An Attacker-Defender Game for Honeynets
A honeynet is a portion of routed but otherwise unused address space that is instrumented for network traffic monitoring. It is an invaluable tool for understanding unwanted Intern...
Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul ...