9842 search results - page 1962 / 1969 » The Complexity of the Matching-Cut Problem |
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
ICS
2010
Tsinghua U.
14 years 7 days ago
2010
Tsinghua U.
Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as an influential computing platform for a broad ...
KR
2010
Springer
14 years 7 days ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
COLCOM
2009
IEEE
14 years 5 days ago
2009
IEEE
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
SACMAT
2009
ACM
14 years 4 days ago
2009
ACM
The role-based access control (RBAC) model has proven to be cost effective to reduce the complexity and costs of access permission management. To maximize the advantages offered...