Sciweavers

3946 search results - page 355 / 790
» The computational complexity of choice sets
Sort
View
267
Voted
ICLP
2009
Springer
16 years 7 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
171
Voted
SMC
2007
IEEE
110views Control Systems» more  SMC 2007»
16 years 1 months ago
A validity index based on cluster symmetry
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
Sriparna Saha, Sanghamitra Bandyopadhyay
CVPR
2000
IEEE
15 years 11 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
191
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
16 years 27 days ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
BC
1998
84views more  BC 1998»
15 years 6 months ago
Stimulus-induced bifurcations in discrete-time neural oscillators
Abstract. Based on theoretical issues and neurobiological evidence, considerable interest has recently focused on dynamic computational elements in neural systems. Such elements re...
Ali A. Minai, Tirunelveli Anand