Sciweavers

446 search results - page 39 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
AI
2010
Springer
13 years 9 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
ICPP
2006
IEEE
14 years 2 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
VISUALIZATION
2003
IEEE
14 years 2 months ago
Fast Volume Segmentation With Simultaneous Visualization Using Programmable Graphics Hardware
Segmentation of structures from measured volume data, such as anatomy in medical imaging, is a challenging data-dependent task. In this paper, we present a segmentation method tha...
Anthony Sherbondy, Michael Houston, Sandy Napel
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 20 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen