594 search results - page 30 / 119 » Heuristic Measures of Interestingness |
203
click to vote
SIGIR
1998
ACM
14 years 11 months ago
1998
ACM
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
65
Voted
STOC
2002
ACM
16 years 6 days ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
117
click to vote
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
106
click to vote
SLIP
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
139
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...