Sciweavers

3680 search results - page 189 / 736
» cases 2010
Sort
View
WRLA
2010
15 years 4 months ago
Folding Variant Narrowing and Optimal Variant Termination
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
Santiago Escobar, Ralf Sasse, José Meseguer
IMCSIT
2010
15 years 4 months ago
BeesyBees - Efficient and Reliable Execution of Service-based Workflow Applications for BeesyCluster using Distributed Agents
Abstract--The paper presents an architecture and implementation that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middlewar...
Pawel Czarnul, Mariusz R. Matuszek, Michal W&oacut...
MASS
2010
15 years 4 months ago
You can't get there from here: Sensor scheduling with refocusing delays
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, L...
CAGD
2010
125views more  CAGD 2010»
15 years 3 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
DATAMINE
2010
161views more  DATAMINE 2010»
15 years 3 months ago
Predicting labels for dyadic data
: In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic predicti...
Aditya Krishna Menon, Charles Elkan