Sciweavers

3154 search results - page 39 / 631
» Computing Closed Skycubes
Sort
View
DAM
2002
82views more  DAM 2002»
13 years 8 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
NIPS
2001
13 years 10 months ago
A Rotation and Translation Invariant Discrete Saliency Network
We describe a neural network which enhances and completes salient closed contours. Our work is different from all previous work in three important ways. First, like the input prov...
Lance R. Williams, John W. Zweck
TLCA
2009
Springer
14 years 3 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
FSTTCS
2001
Springer
14 years 1 months ago
The First-Order Isomorphism Theorem
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
Manindra Agrawal
ICIDS
2010
Springer
13 years 7 months ago
Motivations for Rereading in Interactive Stories: A Preliminary Investigation
This paper describes a preliminary investigation into the concept of rereadability in interactive stories. Through a close reading of the text-based interactive fiction Alabaster, ...
Alex Mitchell