Sciweavers

18209 search results - page 3622 / 3642
» Some Remarks on the Paper
Sort
View
AIPS
2011
13 years 8 days ago
Cross-Domain Action-Model Acquisition for Planning via Web Search
Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of...
Hankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li
ASPLOS
2011
ACM
13 years 8 days ago
RCDC: a relaxed consistency deterministic computer
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic...
Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ce...
CORR
2011
Springer
222views Education» more  CORR 2011»
13 years 6 days ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 6 days ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 5 days 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...
« Prev « First page 3622 / 3642 Last » Next »