Sciweavers

3820 search results - page 440 / 764
» Bounded Model Debugging
Sort
View
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
15 years 9 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 8 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
SIGIR
2008
ACM
15 years 3 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
SIAMJO
2010
155views more  SIAMJO 2010»
14 years 10 months ago
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
Somayeh Moazeni, Thomas F. Coleman, Yuying Li
108
Voted
ECCV
2004
Springer
16 years 5 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum