Sciweavers

779 search results - page 79 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
ICCV
2011
IEEE
14 years 4 months ago
Source Constrained Clustering
We consider the problem of quantizing data generated from disparate sources, e.g. subjects performing actions with different styles, movies with particular genre bias, various con...
Ekaterina Taralova, Fernando DelaTorre, Martial He...
DAGSTUHL
2007
15 years 6 months ago
Electrocardiogram on Wireless Sensor Nodes
Wireless sensor nodes are applicable in a wide range of situations such as the medical, industrial or environmental domains, but the focus is on the biomedical domain. This paper ...
Lennart Yseboodt, Michael De Nil, Mladen Berekovic
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 4 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
180
Voted
PPDP
2010
Springer
15 years 2 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
142
Voted
COLT
2005
Springer
15 years 10 months ago
On Spectral Learning of Mixtures of Distributions
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
Dimitris Achlioptas, Frank McSherry