Sciweavers

922 search results - page 70 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
CC
2010
Springer
135views System Software» more  CC 2010»
13 years 10 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
DAM
2008
76views more  DAM 2008»
13 years 10 months ago
Binary clustering
Abstract. In many clustering systems (hierarchies, pyramids and more generally weak hierarchies) clusters are generated by two elements only. This paper is devoted to such clusteri...
Jean-Pierre Barthélemy, François Bru...
IJAC
2006
87views more  IJAC 2006»
13 years 10 months ago
Evaluation Properties of Symmetric Polynomials
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
Pierrick Gaudry, Éric Schost, Nicolas M. Th...
MST
2006
81views more  MST 2006»
13 years 10 months ago
Local Limit Properties for Pattern Statistics and Rational Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
JAIR
2007
108views more  JAIR 2007»
13 years 10 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen