2612 search results - page 338 / 523 » Switching Graphs and Their Complexity |
103
Voted
NIPS
2003
15 years 6 months ago
2003
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
142
click to vote
PSTV
1993
15 years 5 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
134
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
119
Voted
TROB
2008
15 years 4 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
140
click to vote
PVLDB
2008
15 years 4 months ago
2008
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automati...