Sciweavers

6368 search results - page 22 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
MOC
2000
91views more  MOC 2000»
14 years 9 months ago
A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
Dongwoo Sheen, Ian H. Sloan, Vidar Thomée
WWW
2011
ACM
14 years 4 months ago
Towards semantic knowledge propagation from text corpus to web images
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
Guojun Qi, Charu C. Aggarwal, Thomas Huang
FUIN
2010
106views more  FUIN 2010»
14 years 7 months ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen
JCP
2006
100views more  JCP 2006»
14 years 9 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
ACISP
2001
Springer
15 years 2 months ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito