Sciweavers

5606 search results - page 263 / 1122
» Randomization Techniques for Graphs.
Sort
View
EDM
2009
110views Data Mining» more  EDM 2009»
15 years 4 months ago
Using Learning Decomposition and Bootstrapping with Randomization to Compare the Impact of Different Educational Interventions o
A basic question of instructional interventions is how effective it is in promoting student learning. This paper presents a study to determine the relative efficacy of different in...
Mingyu Feng, Joseph Beck, Neil T. Heffernan
TSP
2010
15 years 1 months ago
Coherence-based performance guarantees for estimating a sparse vector under random noise
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
Zvika Ben-Haim, Yonina C. Eldar, Michael Elad
OOPSLA
2010
Springer
15 years 4 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
ICDAR
2011
IEEE
14 years 6 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
AAAI
2007
15 years 8 months ago
Discovering Near Symmetry in Graphs
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...
Maria Fox, Derek Long, Julie Porteous