5100 search results - page 617 / 1020 » The Linear Complexity of a Graph |
171
click to vote
HICSS
2006
IEEE
16 years 24 days ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
177
Voted
ICALT
2006
IEEE
16 years 24 days ago
2006
IEEE
– Generating LOM for learning material is a complex and tedious task to be manually completed. Therefore, the current trend is to automate this process. However, there are severa...
166
click to vote
INFOCOM
2006
IEEE
16 years 24 days ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
172
click to vote
ICRA
2005
IEEE
16 years 10 days ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
190
click to vote
PPOPP
2005
ACM
16 years 9 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...