1149 search results - page 91 / 230 » Minimally non-Pfaffian graphs |
191
click to vote
JCO
2006
15 years 6 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
184
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
147
click to vote
ICMCS
2007
IEEE
16 years 18 days ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
155
click to vote
IROS
2006
IEEE
16 years 9 days ago
2006
IEEE
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
144
click to vote
ICRA
2005
IEEE
15 years 12 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...