Sciweavers

5100 search results - page 528 / 1020
» The Linear Complexity of a Graph
Sort
View
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 11 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
FPL
2009
Springer
154views Hardware» more  FPL 2009»
15 years 11 months ago
Compiler assisted runtime task scheduling on a reconfigurable computer
Multitasking reconfigurable computers with one or more reconfigurable processors are being used increasingly during the past few years. One of the major challenges in such systems...
Mojtaba Sabeghi, Vlad Mihai Sima, Koen Bertels
EMMCVPR
2001
Springer
15 years 11 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
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
15 years 11 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
STACS
1994
Springer
15 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman