517 search results - page 35 / 104 » Near-Deterministic Inference of AS Relationships |
164
Voted
IUI
2012
ACM
13 years 5 months ago
2012
ACM
We present PhysicsBook, a prototype system that enables users to solve physics problems using a sketch-based interface and then animates any diagram used in solving the problem to...
103
click to vote
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
104
click to vote
BIOCOMP
2008
14 years 11 months ago
2008
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reas...
96
Voted
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
An important precondition for the success of the Semantic Web is founded on the principle that the content of web pages will be semantically annotated. In this paper, we propose a ...