Sciweavers

721 search results - page 74 / 145
» Almost universal graphs
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
ICPADS
2005
IEEE
14 years 3 months ago
On the Connectedness of Peer-to-Peer Overlay Networks
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
Weisheng Si, MingChu Li
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
14 years 2 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
CIKM
2008
Springer
13 years 12 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
ACID
2006
237views Algorithms» more  ACID 2006»
13 years 11 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos