Sciweavers

2517 search results - page 62 / 504
» Specifying Weak Sets
Sort
View
ICALP
2007
Springer
15 years 3 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
AAAI
2007
15 years 2 months ago
Single Document Summarization with Document Expansion
Existing methods for single document summarization usually make use of only the information contained in the specified document. This paper proposes the technique of document expa...
Xiaojun Wan, Jianwu Yang
IPMU
2010
Springer
15 years 3 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
15 years 1 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann
WWW
2006
ACM
16 years 16 days ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang