5214 search results - page 934 / 1043 » The Online Specialization Problem |
116
click to vote
ICDT
2010
ACM
15 years 6 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
152
click to vote
ESCIENCE
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper describes the design and development of a flexible domain-based access control infrastructure for distributed Collaborative Environments. The paper proposes extensions ...
141
Voted
PKC
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
134
click to vote
NIPS
2007
15 years 5 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
130
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...