Sciweavers

284 search results - page 14 / 57
» What Matchings Can Be Stable
Sort
View
ICCBR
2001
Springer
14 years 27 days ago
Helping a CBR Program Know What It Knows
Case-based reasoning systems need to know the limitations of their expertise. Having found the known source cases most relevant to a target problem, they must assess whether those ...
Bruce M. McLaren, Kevin D. Ashley
JSAC
2007
105views more  JSAC 2007»
13 years 8 months ago
What and how much to gain by spectrum agility?
— Static spectrum allocation prohibits radio devices from using spectral bands designated for others. As a result, some bands are under-utilized while other bands are over-popula...
Chun-Ting Chou, Sai Shankar N., Hyoil Kim, Kang G....
ECCV
2008
Springer
14 years 10 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...
ICIP
2004
IEEE
14 years 10 months ago
Using multiscale top points in image matching
In this paper we discuss the feasibility of using singular points in a scale space representation (referred to as top points) for image matching purposes. These points are easily ...
Bram Platel, Frans Kanters, Luc Florack, Evguenia ...
PODC
2006
ACM
14 years 2 months ago
Adversarial queuing on the multiple-access channel
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....