Sciweavers

3323 search results - page 486 / 665
» Computational Semantics with Functional Programming
Sort
View
JGO
2010
100views more  JGO 2010»
15 years 1 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
CCGRID
2005
IEEE
16 years 4 days ago
A grid application development platform for WebCom-G
Grid Computing is becoming more popular. The traditional role of the Internet as being an information repository is evolving to become a resource repository. People using the Inte...
John P. Morrison, Sunil John, David A. Power, Neil...
LCN
1998
IEEE
15 years 10 months ago
High Performance Integrated Network Communications Architecture (INCA)
Current communication subsystem mechanisms within workstation and PC class computers are limiting network communications throughput to a small percentage of the present network da...
Klaus Schug, Anura P. Jayasumana, Prasanth Gopalak...
ICCS
2005
Springer
16 years 15 hour ago
Managing Heterogeneity in a Grid Parallel Haskell
Computational Grids potentially offer cheap large-scale high-performance systems, but are a very challenging architecture, being heterogeneous, shared and hierarchical. Rather tha...
Abdallah Al Zain, Philip W. Trinder, Hans-Wolfgang...
ECCV
1996
Springer
16 years 8 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler