Sciweavers

429 search results - page 51 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
ICCSA
2004
Springer
15 years 3 months ago
Network Probabilistic Connectivity: Exact Calculation with Use of Chains
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
Olga K. Rodionova, Alexey S. Rodionov, Hyunseung C...
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 1 months ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
PVLDB
2008
174views more  PVLDB 2008»
14 years 9 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 1 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...