Sciweavers

2520 search results - page 435 / 504
» The complexity of approximating entropy
Sort
View
ISVC
2010
Springer
14 years 8 months ago
Computer-Generated Tie-Dyeing Using a 3D Diffusion Graph
Abstract. Hand dyeing generates artistic representations with unique and complex patterns. The aesthetics of dyed patterns on a cloth originate from the physical properties of dyei...
Yuki Morimoto, Kenji Ono
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
14 years 8 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
LATIN
2010
Springer
14 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 8 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
PVLDB
2010
110views more  PVLDB 2010»
14 years 8 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...