Sciweavers

943 search results - page 135 / 189
» How should data structures and algorithms be taught
Sort
View
LREC
2010
196views Education» more  LREC 2010»
13 years 9 months ago
An Evaluation of Predicate Argument Clustering using Pseudo-Disambiguation
Schulte im Walde et al. (2008) presented a novel approach to semantic verb classication. The predicate argument model (PAC) presented in their paper models selectional preferences...
Christian Scheible
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
13 years 6 months ago
On optimal AUV track-spacing for underwater mine detection
— This work addresses the task of designing the optimal survey route that an autonomous underwater vehicle (AUV) should take in mine countermeasures (MCM) operations. It is assum...
David P. Williams
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
14 years 2 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
ICDM
2009
IEEE
164views Data Mining» more  ICDM 2009»
14 years 2 months ago
iTopicModel: Information Network-Integrated Topic Modeling
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
Yizhou Sun, Jiawei Han, Jing Gao, Yintao Yu
CIKM
2010
Springer
13 years 5 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan