Sciweavers

3172 search results - page 73 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CVPR
2003
IEEE
15 years 6 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
190
Voted
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
16 years 27 days ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
SAT
2009
Springer
121views Hardware» more  SAT 2009»
15 years 7 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
ITNG
2006
IEEE
15 years 6 months ago
Closed Multidimensional Sequential Pattern Mining
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...
Panida Songram, Veera Boonjing, Sarun Intakosum
102
Voted
GD
2007
Springer
15 years 7 months ago
Minimum Level Nonplanar Patterns for Trees
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
J. Joseph Fowler, Stephen G. Kobourov