Sciweavers

35 search results - page 3 / 7
» Dynamic symbolic data structure repair
Sort
View
PAKDD
1998
ACM
158views Data Mining» more  PAKDD 1998»
13 years 9 months ago
Data Mining Using Dynamically Constructed Recurrent Fuzzy Neural Networks
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
Yakov Frayman, Lipo Wang
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
AI
2000
Springer
13 years 5 months ago
Understanding dynamic scenes
We propose a framework for the representation of visual knowledge in a robotic agent, with special attention to the understanding of dynamic scenes. According to our approach, und...
Antonio Chella, Marcello Frixione, Salvatore Gagli...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 5 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
NSDI
2004
13 years 6 months ago
Structure Management for Scalable Overlay Service Construction
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
Kai Shen