Sciweavers

1291 search results - page 111 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ACL
2010
14 years 11 months ago
Learning Script Knowledge with Web Experiments
We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptio...
Michaela Regneri, Alexander Koller, Manfred Pinkal
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 1 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
JUCS
2010
215views more  JUCS 2010»
14 years 8 months ago
A Multidisciplinary Survey of Computational Techniques for the Modelling, Simulation and Analysis of Biochemical Networks
: All processes of life are controlled by networks of interacting biochemical components. The purpose of modelling these networks is manifold. From a theoretical point of view it a...
James Decraene, Thomas Hinze
ASIACRYPT
2006
Springer
15 years 5 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
WWW
2005
ACM
16 years 2 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa