Sciweavers

900 search results - page 177 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
JUCS
2008
166views more  JUCS 2008»
13 years 8 months ago
Exposure and Support of Latent Social Networks among Learning Object Repository Users
Abstract: Although immense efforts have been invested in the construction of hundreds of learning object repositories, the degree of reuse of learning resources maintained in such ...
Peng Han, Gerd Kortemeyer, Bernd J. Krämer, C...
TIP
1998
99views more  TIP 1998»
13 years 8 months ago
Nonlinear image estimation using piecewise and local image models
—We introduce a new approach to image estimation based on a flexible constraint framework that encapsulates meaningful structural image assumptions. Piecewise image models (PIMâ...
Scott T. Acton, Alan C. Bovik
FOCS
2010
IEEE
13 years 6 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
ATAL
2006
Springer
14 years 9 days ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...