Sciweavers

12459 search results - page 44 / 2492
» cans 2006
Sort
View
JSC
2006
72views more  JSC 2006»
13 years 7 months ago
Algebraic solutions of holomorphic foliations: An algorithmic approach
We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their im...
S. C. Coutinho, L. Menasché Schechter
JSS
2006
62views more  JSS 2006»
13 years 7 months ago
Designing state-based systems with entity-life modeling
This article introduces the entity-life modeling (ELM) design approach for multithread software. The article focuses on problems that can be described by state machines with assoc...
Bo Sandén, Janusz Zalewski
JUCS
2006
102views more  JUCS 2006»
13 years 7 months ago
Data Mining Methods for Discovering Interesting Exceptions from an Unsupervised Table
Abstract: In this paper, we survey efforts devoted to discovering interesting exceptions from data in data mining. An exception differs from the rest of data and thus is interestin...
Einoshin Suzuki
MP
2006
113views more  MP 2006»
13 years 7 months ago
A class of polynomially solvable linear complementarity problems
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
Teresa H. Chu
FUIN
2007
109views more  FUIN 2007»
13 years 7 months ago
Computing Properties of Numerical Imperative Programs by Symbolic Computation
We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implement...
Jacques Carette, Ryszard Janicki