Sciweavers

1039 search results - page 197 / 208
» Kernels and Regularization on Graphs
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 10 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
COMAD
2009
14 years 10 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
ICASSP
2010
IEEE
14 years 9 months ago
Synthesizing speech from Doppler signals
It has long been considered a desirable goal to be able to construct an intelligible speech signal merely by observing the talker in the act of speaking. Past methods at performin...
Arthur R. Toth, Kaustubh Kalgaonkar, Bhiksha Raj, ...
ECCC
2010
89views more  ECCC 2010»
14 years 9 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
ACTA
2006
104views more  ACTA 2006»
14 years 9 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti