Sciweavers

702 search results - page 50 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
EMMCVPR
2001
Springer
15 years 4 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
IS
2007
14 years 11 months ago
Improving process models by discovering decision points
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
Sharmila Subramaniam, Vana Kalogeraki, Dimitrios G...
124
Voted
ALGORITHMICA
2008
110views more  ALGORITHMICA 2008»
14 years 12 months ago
Bandwidth-Constrained Allocation in Grid Computing
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
Anshul Kothari, Subhash Suri, Yunhong Zhou
IACR
2011
130views more  IACR 2011»
13 years 11 months ago
Hiding the Policy in Cryptographic Access Control
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...
Sascha Müller, Stefan Katzenbeisser
AMAI
2004
Springer
15 years 5 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian