Sciweavers

1314 search results - page 236 / 263
» Approximate data mining in very large relational data
Sort
View
SOCIALCOM
2010
14 years 11 months ago
Traffic in Social Media I: Paths Through Information Networks
Wikipedia is used every day by people all around the world, to satisfy a variety of information needs. We crosscorrelate multiple Wikipedia traffic data sets to infer various behav...
Jacob Ratkiewicz, Alessandro Flammini, Filippo Men...
106
Voted
IPSN
2010
Springer
15 years 8 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
NIPS
2004
15 years 2 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
96
Voted
BMCBI
2006
100views more  BMCBI 2006»
15 years 1 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
131
Voted
TOG
2002
212views more  TOG 2002»
15 years 1 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...