Sciweavers

2100 search results - page 80 / 420
» Fundamentals of the problem
Sort
View
DAM
1999
128views more  DAM 1999»
13 years 10 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
INFOCOM
2003
IEEE
14 years 3 months ago
Prophet Address Allocation for Large Scale MANETs
—A mobile device in a MANET must be assigned a free IP address before it may participate in unicast communication. This is a fundamental and difficult problem in the practical us...
Hongbo Zhou, Lionel M. Ni, Matt W. Mutka
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 12 months ago
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
Hamid Zarrabi-Zadeh
ICMCS
2006
IEEE
112views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Where was the Picture Taken: Image Localization in Route Panoramas Using Epipolar Geometry
Finding the location where a picture was taken is an important problem for a variety of applications including surveying, interactive traveling and homeland security among others....
Saad M. Khan, Fahd Rafi, Mubarak Shah
CDC
2009
IEEE
135views Control Systems» more  CDC 2009»
14 years 2 months ago
Trust Estimation in autonomic networks: a statistical mechanics approach
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
Stefano Ermon, Luca Schenato, Sandro Zampieri