Sciweavers

5473 search results - page 724 / 1095
» On the graph isomorphism problem
Sort
View
AAAI
2008
15 years 9 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
IJCAI
2007
15 years 8 months ago
Improving Author Coreference by Resource-Bounded Information Gathering from the Web
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
Pallika Kanani, Andrew McCallum, Chris Pal
MMNS
2007
120views Multimedia» more  MMNS 2007»
15 years 8 months ago
Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a s...
Li Li, Bin Qin, Chunyuan Zhang
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 8 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
SIROCCO
2004
15 years 8 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin