Sciweavers

4560 search results - page 132 / 912
» Finding Data in the Neighborhood
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 8 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...

Publication
1147views
15 years 6 months ago
PDE-based fast local level set method
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
Danping Peng, Barry Merriman, Stanley Osher, Hongk...
TIT
2008
122views more  TIT 2008»
13 years 8 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
TMC
2008
90views more  TMC 2008»
13 years 8 months ago
Trust-Based Fast Authentication for Multiowner Wireless Networks
In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. W...
Jahan Hassan, Harsha Sirisena, Björn Landfeld...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 6 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...