Sciweavers

3267 search results - page 528 / 654
» Generalized quasirandom graphs
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
16 years 1 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
WEBI
2009
Springer
16 years 1 months ago
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...
ATAL
2009
Springer
16 years 1 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
CIKM
2009
Springer
16 years 1 months ago
Graph-based seed selection for web-scale crawlers
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
CIKM
2009
Springer
16 years 1 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec