Sciweavers

1722 search results - page 229 / 345
» On the sample mean of graphs
Sort
View
CCCG
2009
15 years 7 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
AI
2010
Springer
15 years 6 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
A Mobile Computing Architecture for Numerical Simulation
The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources suc...
Cyril Dumont, Fabrice Mourlin
JODS
2007
119views Data Mining» more  JODS 2007»
15 years 6 months ago
Semantic Matching: Algorithms and Implementation
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
ICWE
2010
Springer
15 years 4 months ago
Semantic Wonder Cloud: Exploratory Search in DBpedia
Inspired by the Google Wonder Wheel1 , in this paper we present Semantic Wonder Cloud (SWOC): a tool that helps users in knowledge exploration within the DBpedia dataset by adoptin...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...