Sciweavers

16404 search results - page 148 / 3281
» A set coverage problem
Sort
View
148
Voted
IJWMC
2010
115views more  IJWMC 2010»
15 years 19 days ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
ACL
2007
15 years 4 months ago
A Simple, Similarity-based Model for Selectional Preferences
We propose a new, simple model for the automatic induction of selectional preferences, using corpus-based semantic similarity metrics. Focusing on the task of semantic role labeli...
Katrin Erk
LWA
2007
15 years 4 months ago
Meta-Learning Rule Learning Heuristics
The goal of this paper is to investigate to what extent a rule learning heuristic can be learned from experience. Our basic approach is to learn a large number of rules and record ...
Frederik Janssen, Johannes Fürnkranz
122
Voted
DIS
2007
Springer
15 years 9 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 9 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield