Sciweavers

2635 search results - page 32 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
ICTAI
1997
IEEE
14 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
ICPR
2002
IEEE
14 years 11 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
CCCG
2008
13 years 11 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
SUM
2007
Springer
14 years 4 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
FECS
2006
529views Education» more  FECS 2006»
13 years 11 months ago
Student Projects in Computer Networking: Simulation versus Coding
In this paper, we discuss the advantages and disadvantages of using network simulators to teach networking concepts versus having students write programs. The authors have experie...
Leann Christianson, Kevin Q. Brown