Sciweavers

320 search results - page 8 / 64
» View selection using randomized search
Sort
View
SASO
2007
IEEE
14 years 1 months ago
Improving ICE Service Selection in a P2P System using the Gradient Topology
Internet Connectivity Establishment (ICE) is becoming increasingly important for P2P systems on the open Internet, as it enables NAT-bound peers to provide accessible services. A ...
Jim Dowling, Jan Sacha, Seif Haridi
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 3 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
14 years 2 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li
JAL
2008
97views more  JAL 2008»
13 years 7 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes