115 search results - page 13 / 23 » The Complexity of List Ranking of Trees |
118
click to vote
MM
2003
ACM
15 years 3 months ago
2003
ACM
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
AAAI
2010
14 years 11 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
103
click to vote
PLANX
2008
14 years 11 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...