Sciweavers

1883 search results - page 217 / 377
» Ordered theta graphs
Sort
View
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 3 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
FOCS
2009
IEEE
14 years 2 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
INFOCOM
2008
IEEE
14 years 2 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
AAMAS
2005
Springer
14 years 1 months ago
Towards Adaptive Role Selection for Behavior-Based Agents
This paper presents a model for adaptive agents. The model describes the behavior of an agent as a graph of roles, in short a behavior graph. Links between roles provide conditions...
Danny Weyns, Kurt Schelfthout, Tom Holvoet, Olivie...
RANDOM
1998
Springer
14 years 12 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang