Sciweavers

826 search results - page 121 / 166
» Computational studies using a novel simplicial-approximation...
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
DOCENG
2006
ACM
14 years 1 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
SAC
2008
ACM
13 years 7 months ago
Test generation and minimization with "basic" statecharts
Model-based testing as a black-box testing technique has grown in importance. The models used represent the relevant features of the system under consideration (SUC), and can also...
Fevzi Belli, Axel Hollmann
TMC
2011
127views more  TMC 2011»
13 years 2 months ago
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
Sheng-Po Kuo, Yu-Chee Tseng
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 5 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu