Sciweavers

528 search results - page 60 / 106
» Degrees of categoricity of computable structures
Sort
View
ICNS
2009
IEEE
13 years 6 months ago
Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata
AAAI
2007
13 years 11 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
COMPGEOM
2008
ACM
13 years 10 months ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
CIKM
2006
Springer
14 years 13 days ago
CP/CV: concept similarity mining without frequency information from domain describing taxonomies
Domain specific ontologies are heavily used in many applications. For instance, these form the bases on which similarity/dissimilarity between keywords are extracted for various k...
Jong Wook Kim, K. Selçuk Candan
SPAA
2009
ACM
14 years 3 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn