Sciweavers

11160 search results - page 381 / 2232
» Incompleteness in a General Setting
Sort
View
DM
2006
135views more  DM 2006»
15 years 6 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman
FUIN
2007
93views more  FUIN 2007»
15 years 6 months ago
Davis-Putnam Style Rules for Deciding Property S
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e = ∅, for all e ∈ E and f ⊆ σ, for all f ...
Robert Cowen, Adam Kolany
CONCUR
2005
Springer
16 years 11 days ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...
ESANN
2008
15 years 8 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
CHI
2011
ACM
14 years 10 months ago
Eden: a professional multitouch tool for constructing virtual organic environments
Set construction is the process of selecting and positioning virtual geometric objects to create a virtual environment used in a computer-animated film. Set construction artists ...
Kenrick Kin, Tom Miller, Björn Bollensdorff, ...