1200 search results - page 144 / 240 » Marked Ancestor Problems |
177
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
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...
132
Voted
MFCS
2009
Springer
15 years 12 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
128
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
137
click to vote
RECOMB
2009
Springer
16 years 6 months ago
2009
Springer
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
255
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...