Sciweavers

157 search results - page 17 / 32
» Combining Two Structured Domains for Modeling Various Graph ...
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
WWW
2008
ACM
14 years 8 months ago
Topic modeling with network regularization
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic mo...
Qiaozhu Mei, Deng Cai, Duo Zhang, ChengXiang Zhai
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
ICSM
2009
IEEE
14 years 2 months ago
A combinatorial approach to building navigation graphs for dynamic web applications
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
Wenhua Wang, Yu Lei, Sreedevi Sampath, Raghu Kacke...
ECCV
2004
Springer
14 years 9 months ago
Hand Motion from 3D Point Trajectories and a Smooth Surface Model
A method is proposed to track the full hand motion from 3D points reconstructed using a stereoscopic set of cameras. This approach combines the advantages of methods that use 2D mo...
Guillaume Dewaele, Frederic Devernay, Radu Horaud