Sciweavers

528 search results - page 22 / 106
» Degrees of categoricity of computable structures
Sort
View
ISPDC
2007
IEEE
14 years 2 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat
CAGD
2008
99views more  CAGD 2008»
13 years 8 months ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz
HIPC
2007
Springer
14 years 2 months ago
Structuring Unstructured Peer-to-Peer Networks
Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular...
Stefan Schmid, Roger Wattenhofer
EMNLP
2008
13 years 10 months ago
Computing Word-Pair Antonymy
Knowing the degree of antonymy between words has widespread applications in natural language processing. Manually-created lexicons have limited coverage and do not include most se...
Saif Mohammad, Bonnie J. Dorr, Graeme Hirst
IPC
2007
IEEE
14 years 2 months ago
Semantic Tolerance Relation-Based Image Representation and Classification
The nature of the concepts regarding images in many domains are imprecise, and the interpretation of finding similar images is also ambiguous and subjective on the level of human ...
Ying Dai