Sciweavers

522 search results - page 22 / 105
» The 3-Steiner Root Problem
Sort
View
COMGEO
2006
ACM
13 years 8 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 8 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
ACSAC
2007
IEEE
14 years 3 months ago
Establishing and Sustaining System Integrity via Root of Trust Installation
Integrity measurements provide a means by which distributed systems can assess the trustability of potentially compromised remote hosts. However, current measurement techniques si...
Luke St. Clair, Joshua Schiffman, Trent Jaeger, Pa...
COMPGEOM
2005
ACM
13 years 10 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
TKDE
2008
153views more  TKDE 2008»
13 years 8 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang