Sciweavers

29 search results - page 4 / 6
» Weighted Boolean conditions for ranking
Sort
View
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 7 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
KES
2008
Springer
13 years 6 months ago
Fuzzy diagnosis of turbomachines
This paper presents a fuzzy knowledge-based system for turbomachinery diagnosis. Given symptoms associated with a vibration problem, the system can identify and rank possible cause...
Meijun Yang, Qiang Shen
ICASSP
2011
IEEE
12 years 10 months ago
Multi-rank processing for passive ranging in underwater acoustic environments subject to spatial coherence loss
In this work we derive the maximum likelihood estimator for passive wavefront curvature ranging systems operating in environments subject to a spatial coherence loss. As a consequ...
Hongya Ge, Ivars P. Kirsteins
PVLDB
2008
116views more  PVLDB 2008»
13 years 6 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim