Sciweavers

3630 search results - page 652 / 726
» Fast Marching Methods
Sort
View
AIPS
2010
14 years 16 days ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
LREC
2010
180views Education» more  LREC 2010»
13 years 11 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
WORM
2003
13 years 11 months ago
Worm propagation modeling and analysis under dynamic quarantine defense
Due to the fast spreading nature and great damage of Internet worms, it is necessary to implement automatic mitigation, such as dynamic quarantine, on computer networks. Enlighten...
Cliff Changchun Zou, Weibo Gong, Donald F. Towsley
HUC
2010
Springer
13 years 11 months ago
Groupthink: usability of secure group association for wireless devices
A fairly common modern setting entails users, each in possession of a personal wireless device, wanting to communicate securely, via their devices. If these users (and their devic...
Rishab Nithyanand, Nitesh Saxena, Gene Tsudik, Ers...
ECCV
2010
Springer
13 years 10 months ago
Efficient Computation of Scale-Space Features for Deformable Shape Correspondences
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...
Tingbo Hou, Hong Qin