Sciweavers

779 search results - page 127 / 156
» Information-theoretic Competitive Learning
Sort
View
DAC
2005
ACM
14 years 8 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
WWW
2009
ACM
14 years 8 months ago
Personalized recommendation on dynamic content using predictive bilinear models
In Web-based services of dynamic content (such as news articles), recommender systems face the difficulty of timely identifying new items of high-quality and providing recommendat...
Wei Chu, Seung-Taek Park
CP
2009
Springer
14 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
14 years 8 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
PERCOM
2004
ACM
14 years 7 months ago
A User-Guided Cognitive Agent for Network Service Selection in Pervasive Computing Environments
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
George Lee, Peyman Faratin, Steven Bauer, John Wro...