Sciweavers

11051 search results - page 72 / 2211
» An Investigation of Generalized Cases
Sort
View
P2P
2008
IEEE
14 years 4 months ago
Playing with the Bandwidth Conservation Law
We investigate performance bounds of P2P systems by application of the law of bandwidth conservation. This approach is quite general and allows us to consider various sharing syst...
Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego...
ESWS
2007
Springer
14 years 4 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
ML
1998
ACM
115views Machine Learning» more  ML 1998»
13 years 10 months ago
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...
Paul W. Finn, Stephen Muggleton, David Page, Ashwi...
COMPGEOM
2001
ACM
14 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ARSCOM
2005
61views more  ARSCOM 2005»
13 years 10 months ago
On multi-avoidance of generalized patterns
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre...
Sergey Kitaev, Toufik Mansour