Sciweavers

3367 search results - page 669 / 674
» Incremental assignment problem
Sort
View
PAMI
2010
139views more  PAMI 2010»
14 years 8 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
SOCO
2010
Springer
14 years 8 months ago
Automatic detection of trends in time-stamped sequences: an evolutionary approach
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
Lourdes Araujo, Juan Julián Merelo Guerv&oa...
TC
2010
14 years 8 months ago
The Design and Evaluation of a Self-Organizing Superpeer Network
—Superpeer architectures exploit the heterogeneity of nodes in a peer-to-peer (P2P) network by assigning additional responsibilities to higher capacity nodes. In the design of a ...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
TMC
2010
150views more  TMC 2010»
14 years 8 months ago
Handling Mobility in Wireless Sensor and Actor Networks
— In Wireless Sensor and Actor Networks (WSANs), the collaborative operation of sensors enables the distributed sensing of a physical phenomenon, while actors collect and process...
Tommaso Melodia, Dario Pompili, Ian F. Akyildiz
WINET
2010
105views more  WINET 2010»
14 years 8 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...