Sciweavers

187 search results - page 30 / 38
» Labeling Schemes for Tree Representation
Sort
View
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
13 years 5 months ago
Analyzing Abnormal Events from Spatio-temporal Trajectories
Advances in RFID based sensor technologies has been used in applications which requires the tracking of assets, products and individuals. The recording of such movements is capture...
Dhaval Patel, Chidansh Bhatt, Wynne Hsu, Mong-Li L...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
CIG
2005
IEEE
14 years 1 months ago
Board Evaluation For The Virus Game
Abstract- The Virus Game (or simply Virus) is a turnbased two player perfect information game which is based on the growth and spread of competing viruses. This paper describes a C...
Peter I. Cowling
JMLR
2010
141views more  JMLR 2010»
13 years 2 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 5 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri