Sciweavers

2192 search results - page 144 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JVCA
2007
93views more  JVCA 2007»
13 years 8 months ago
Gradient-based shell generation and deformation
Shell becomes popular in a variety of modeling techniques for representing small-scale features and increasing visual complexity. Current shell generation algorithms do not measur...
Jin Huang, Xinguo Liu, Haiyang Jiang, Qing Wang, H...
TON
1998
186views more  TON 1998»
13 years 8 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
WWW
2008
ACM
14 years 9 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
ATAL
2006
Springer
14 years 2 days ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
AIPS
2009
13 years 9 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...