Sciweavers

4103 search results - page 177 / 821
» Some results on the Collatz problem
Sort
View
ICALP
2010
Springer
15 years 8 months ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
EUSFLAT
2007
121views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Domination and Information Boundedness Principle for Aggregation
The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contai...
Michal Sabo
CCCG
2006
15 years 8 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky
FFA
2006
77views more  FFA 2006»
15 years 6 months ago
Linear error-block codes
A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration an...
Keqin Feng, Lanju Xu, Fred J. Hickernell
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag