Sciweavers

1133 search results - page 222 / 227
» Basics of Graph Cuts
Sort
View
CAISE
2003
Springer
14 years 26 days ago
Hybrid Publish-Subscribe: A Compromise Approach for Large-Scale
Abstract. The purpose of this article is to propose a scalable, topologically and traffic-wise self-adapting approach to a publish/subscribe paradigm for supporting event-based app...
Roman Szarowski
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 6 days ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 3 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 3 days ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
SIGUCCS
2000
ACM
13 years 12 months ago
Knowledgebase Integration with a 24-hour Help Desk
The University of Pittsburgh's Computing Services and Systems Development organization is focused on the needs of the faculty and student population, totaling nearly 40,000 u...
Jay Graham, Brian K. Hart