Sciweavers

721 search results - page 21 / 145
» Graphs with Large Obstacle Numbers
Sort
View
ICRA
2009
IEEE
107views Robotics» more  ICRA 2009»
14 years 4 months ago
Graph-based planning using local information for unknown outdoor environments
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
Jinhan Lee, Roozbeh Mottaghi, Charles Pippin, Tuck...
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 7 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ORL
2007
102views more  ORL 2007»
13 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
14 years 11 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
TAMC
2010
Springer
14 years 2 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft