Sciweavers

1019 search results - page 115 / 204
» Uniform Functors on Sets
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
14 years 10 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
102
Voted
NECO
2008
101views more  NECO 2008»
14 years 10 months ago
On the Classification Capability of Sign-Constrained Perceptrons
The perceptron (also referred to as McCulloch-Pitts neuron, or linear threshold gate) is commonly used as a simplified model for the discrimination and learning capability of a bi...
Robert A. Legenstein, Wolfgang Maass
PAMI
2008
250views more  PAMI 2008»
14 years 10 months ago
Combined Top-Down/Bottom-Up Segmentation
We construct an image segmentation scheme that combines top-down (TD) with bottom-up (BU) processing. In the proposed scheme, segmentation and recognition are intertwined rather th...
Eran Borenstein, Shimon Ullman
IANDC
2007
133views more  IANDC 2007»
14 years 10 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
TIT
2008
84views more  TIT 2008»
14 years 10 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
Michael Langberg, Alexander Sprintson, Jehoshua Br...