Sciweavers

3047 search results - page 102 / 610
» Randomized Parallel Selection
Sort
View
SPAA
2009
ACM
14 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
LATIN
2004
Springer
14 years 3 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
ICMCS
2005
IEEE
191views Multimedia» more  ICMCS 2005»
14 years 3 months ago
A gridding Hough transform for detecting the straight lines in sports video
A gridding Hough transform (GHT) is proposed to detect the straight lines in sports video, which is much faster and requires much less memory than the previous Hough transforms. T...
Xinguo Yu, Hoe Chee Lai, Sophie Xiao Fan Liu, Hon ...
CIKM
2009
Springer
14 years 4 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
MSWIM
2006
ACM
14 years 4 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari