Sciweavers

301 search results - page 33 / 61
» The k-Median Problem for Directed Trees
Sort
View
TIT
2011
149views more  TIT 2011»
13 years 2 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
PACT
2009
Springer
14 years 3 days ago
Parallel Evidence Propagation on Multicore Processors
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
Yinglong Xia, Xiaojun Feng, Viktor K. Prasanna
DAGSTUHL
2003
13 years 9 months ago
Genetic Design: Amplifying Our Ability to Deal With Requirements Complexity
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
R. Geoff Dromey
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
13 years 2 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu