Sciweavers

2950 search results - page 144 / 590
» Computing with Infinitely Many Processes
Sort
View
126
Voted
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 7 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
109
Voted
IWEC
2004
15 years 4 months ago
Game-Driven Intelligent Tutoring Systems
With the increase of computer capabilities, many learning systems have become complex simulators with advanced interfaces close to game quality. However, many games features have n...
Marco Antonio Gómez-Martín, Pedro Pa...
ACL
1996
15 years 4 months ago
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
Mehryar Mohri, Richard Sproat
102
Voted
ICIP
2010
IEEE
15 years 18 days ago
Anisotropic diffusion using power watersheds
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...
Camille Couprie, Leo J. Grady, Laurent Najman, Hug...
124
Voted
ICVS
2009
Springer
15 years 9 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter