Sciweavers

1722 search results - page 69 / 345
» On the sample mean of graphs
Sort
View
BIRTHDAY
2010
Springer
14 years 10 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
109
Voted
WSC
2007
15 years 16 days ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
BIRTHDAY
2010
Springer
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
ICIP
2000
IEEE
15 years 11 months ago
Nonlinear Image Interpolation Through Extended Permutation Filters
This paper examines the application of extended permutation rank selection (EPRS) filters in image interpolation. EPRS filters are constrained to output an order statistic based o...
Deva Ramanan, Kenneth E. Barner
ISBI
2009
IEEE
15 years 5 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand