Sciweavers

363 search results - page 28 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 5 months ago
Constraint-Guided Workflow Composition Based on the EDAM Ontology
Abstract. Methods for the automatic composition of services into executable workflows need detailed knowledge about the application domain, in particular about the available servic...
Anna-Lena Lamprecht, Stefan Naujokat, Bernhard Ste...
ICNP
2003
IEEE
14 years 29 days ago
Characterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Sonia Fahmy, Minseok Kwon
NIPS
2007
13 years 9 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
CIS
2004
Springer
14 years 1 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 8 months ago
Analysis of sampling techniques for association rule mining
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...