Sciweavers

2322 search results - page 239 / 465
» On a game in directed graphs
Sort
View
AAAI
2008
15 years 8 months ago
Query-URL Bipartite Based Approach to Personalized Query Recommendation
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendati...
Lin Li, Zhenglu Yang, Ling Liu, Masaru Kitsuregawa
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 6 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
VLSISP
2002
112views more  VLSISP 2002»
15 years 6 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
16 years 1 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 1 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés