Sciweavers

304 search results - page 32 / 61
» An Efficient Method for Evaluating Complex Polynomials
Sort
View
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 4 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
14 years 9 months ago
Querying Structured Text in an XML Database
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
Shurug Al-Khalifa, Cong Yu, H. V. Jagadish
EOR
2002
100views more  EOR 2002»
13 years 8 months ago
A buyer-seller game model for selection and negotiation of purchasing bids
Selection and negotiation of purchasing bids is a complex decision making process that requires consideration of a variety of vendor attributes such as price, delivery performance...
Srinivas Talluri
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 9 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
ICIP
2009
IEEE
14 years 10 months ago
Discrete Curvature Calculation For Fast Level Set Segmentation
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...