1133 search results - page 200 / 227 » Basics of Graph Cuts |
141
Voted
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...
126
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
2005
IEEE
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
144
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
149
Voted
CLOUD
2010
ACM
15 years 8 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
154
Voted
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...