Sciweavers

1887 search results - page 32 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
IJCAI
1989
13 years 8 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
WEBI
2005
Springer
14 years 1 months ago
A Method of Web Search Result Clustering Based on Rough Sets
Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to ...
Chi Lang Ngo, Hung Son Nguyen
IJNSEC
2008
75views more  IJNSEC 2008»
13 years 7 months ago
A Key Management Scheme for Hierarchical Access Control in Group Communication
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...
Qiong Zhang, Yuke Wang, Jason P. Jue
AUSDM
2007
Springer
84views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Detecting Anomalous Longitudinal Associations Through Higher Order Mining
The detection of unusual or anomalous data is an important function in automated data analysis or data mining. However, the diversity of anomaly detection algorithms shows that it...
Ping Liang, John F. Roddick