Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

PODC
2000
ACM

favoriteEmaildiscussreport

77views Distributed and Parallel Com...» more PODC 2000»

Efficient generation of all regular non-dominated coteries

14 years 2 months ago

Efficient generation of all regular non-dominated coteries

Download www.cs.sfu.ca

A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which

Kazuhisa Makino, Tiko Kameda

Real-time Traffic

Common | Distributed And Parallel Computing | PODC 2000 |

claim paper

Related Content

» Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions

» Entire regularization paths for graph data

» Efficient constraint evaluation in categorical sequential pattern mining for trajectory da...

» Convicting exploitable software vulnerabilities An efficient input provenance based approa...

» Efficient Techniques to Explore and Rank Paths in Life Science Data Sources

» Efficient memory representation of XML document trees

» InFocus Imaging by Mosaicking and SuperResolution

» A tool set for the quick and efficient exploration of large document collections

» Doubledeck elevator systems using Genetic Network Programming with reinforcement learning

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	PODC
Authors	Kazuhisa Makino, Tiko Kameda

Comments (0)