Sciweavers

1186 search results - page 150 / 238
» Improving Random Walk Performance
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 10 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IJCV
2008
266views more  IJCV 2008»
13 years 10 months ago
Learning to Recognize Objects with Little Supervision
This paper shows (i) improvements over state-of-the-art local feature recognition systems, (ii) how to formulate principled models for automatic local feature selection in object c...
Peter Carbonetto, Gyuri Dorkó, Cordelia Sch...
FUIN
2006
139views more  FUIN 2006»
13 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
TNN
2008
93views more  TNN 2008»
13 years 10 months ago
Towards the Optimal Design of Numerical Experiments
This paper addresses the problem of the optimal design of numerical experiments for the construction of nonlinear surrogate models. We describe a new method, called learner disagre...
S. Gazut, J.-M. Martinez, Gérard Dreyfus, Y...
COMPUTER
1999
82views more  COMPUTER 1999»
13 years 9 months ago
Mapping the Internet
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
Hal Burch, Bill Cheswick