Sciweavers

811 search results - page 84 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
SIGGRAPH
1997
ACM
14 years 15 days ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...
SAC
2008
ACM
13 years 8 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
ERSHOV
2009
Springer
14 years 25 days ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
TEC
2002
119views more  TEC 2002»
13 years 8 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...