Sciweavers

10916 search results - page 298 / 2184
» On Constructive Connectives and Systems
Sort
View
CPC
2006
116views more  CPC 2006»
15 years 6 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
COMBINATORICS
2007
85views more  COMBINATORICS 2007»
15 years 6 months ago
Maximum Cardinality 1-Restricted Simple 2-Matchings
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
David Hartvigsen
IPMI
2011
Springer
14 years 10 months ago
Learning an Atlas of a Cognitive Process in Its Functional Geometry
In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...
Georg Langs, Danial Lashkari, Andrew Sweet, Yanmei...
JACM
2002
87views more  JACM 2002»
15 years 6 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
KCAP
2003
ACM
16 years 1 days ago
Learner: a system for acquiring commonsense knowledge by analogy
One of the long-term goals of Artificial Intelligence is construction of a machine that is capable of reasoning about the everyday world the way humans are. In this paper, I fir...
Timothy Chklovski