Sciweavers

60 search results - page 2 / 12
» On almost precipitous ideals
Sort
View
APAL
2004
132views more  APAL 2004»
14 years 9 months ago
Canonical structure in the universe of set theory: part one
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
James Cummings, Matthew Foreman, Menachem Magidor
HYBRID
2004
Springer
15 years 2 months ago
Almost ASAP Semantics: From Timed Models to Timed Implementations
In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP3 semantics (also called ...
Martin De Wulf, Laurent Doyen, Jean-Françoi...
EJIS
2008
49views more  EJIS 2008»
14 years 9 months ago
IT employment prospects: beyond the dotcom bubble
In the 1990s, enrollments grew rapidly in information systems (IS) and computer science. Then, beginning in 2000 and 2001, enrollments declined precipitously. This paper looks at ...
Raymond R. Panko
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
IPM
2008
90views more  IPM 2008»
14 years 9 months ago
Interactive high-quality text classification
Automatic text classification (TC) is essential for information sharing and management. Its ideal goals are to achieve high-quality TC: (1) accepting almost all documents that sho...
Rey-Long Liu