Sciweavers

65 search results - page 4 / 13
» Categoricity in abstract elementary classes with no maximal ...
Sort
View
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
SIGIR
2010
ACM
13 years 11 months ago
Prototype hierarchy based clustering for the categorization and navigation of web collections
This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web ...
Zhaoyan Ming, Kai Wang, Tat-Seng Chua
CIARP
2006
Springer
13 years 11 months ago
Oscillating Feature Subset Search Algorithm for Text Categorization
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
Jana Novovicová, Petr Somol, Pavel Pudil
DBPL
2009
Springer
144views Database» more  DBPL 2009»
14 years 2 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu
ENTCS
2007
158views more  ENTCS 2007»
13 years 7 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer