Sciweavers

2001 search results - page 170 / 401
» Local solutions for global problems in wireless networks
Sort
View
NIPS
2001
15 years 7 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
MP
2010
162views more  MP 2010»
15 years 4 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
MOBICOM
2006
ACM
16 years 11 days ago
OURS: optimal unicast routing systems in non-cooperative wireless networks
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu...
PERCOM
2006
ACM
16 years 6 months ago
Unearthing Design Patterns to Support Context-Awareness
The lack of structured methodologies and software engineering efforts on designing the support of contextawareness in pervasive systems hinders the potential advantages of analyzi...
Oriana Riva, Cristiano di Flora, Stefano Russo, Ki...
CVPR
2008
IEEE
15 years 8 months ago
A rank constrained continuous formulation of multi-frame multi-target tracking problem
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
Khurram Shafique, Mun Wai Lee, Niels Haering