Sciweavers

4047 search results - page 44 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
IPM
2008
196views more  IPM 2008»
14 years 11 months ago
Author identification: Using text sampling to handle the class imbalance problem
Authorship analysis of electronic texts assists digital forensics and anti-terror investigation. Author identification can be seen as a single-label multi-class text categorizatio...
Efstathios Stamatatos
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 3 days ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
LPNMR
2009
Springer
15 years 4 months ago
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
Esra Erdem
JSYML
2002
64views more  JSYML 2002»
14 years 11 months ago
Blowing up The Power Set of The Least Measurable
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...
Arthur W. Apter, James Cummings
ENDM
2008
142views more  ENDM 2008»
14 years 12 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff