Sciweavers

4302 search results - page 261 / 861
» Index Pairs Algorithms
Sort
View
103
Voted
DISOPT
2008
107views more  DISOPT 2008»
15 years 1 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
JPDC
2008
161views more  JPDC 2008»
15 years 1 months ago
Base station placement on boundary of a convex polygon
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
Sasanka Roy, Debabrata Bardhan, Sandip Das
TCSV
2002
101views more  TCSV 2002»
15 years 20 days ago
A family of wavelet-based stereo image coders
Abstract--In this paper, we propose novel algorithms for stereoscopic image coding based on the hierarchical decomposition of stereo information. The proposed schemes, based on wav...
Nikolaos V. Boulgouris, Michael G. Strintzis
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
14 years 11 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
NAR
2011
211views Computer Vision» more  NAR 2011»
14 years 3 months ago
DIMA 3.0: Domain Interaction Map
Domain Interaction MAp (DIMA, available at http:// webclu.bio.wzw.tum.de/dima) is a database of predicted and known interactions between protein domains. It integrates 5807 struct...
Qibin Luo, Philipp Pagel, Baiba Vilne, Dmitrij Fri...