Sciweavers

75 search results - page 12 / 15
» Test-Case Calculation through Abstraction
Sort
View
TON
2008
134views more  TON 2008»
15 years 1 months ago
Efficient broadcasting using network coding
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
Christina Fragouli, Jörg Widmer, Jean-Yves Le...
125
Voted
ICIAR
2010
Springer
15 years 11 days ago
Adaptive Regularization Parameter for Graph Cut Segmentation
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
Sema Candemir, Yusuf Sinan Akgul
SIAMJO
2010
87views more  SIAMJO 2010»
15 years 7 days ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
GAMESEC
2010
136views Game Theory» more  GAMESEC 2010»
14 years 12 months ago
Effective Multimodel Anomaly Detection Using Cooperative Negotiation
Abstract. Many computer protection tools incorporate learning techniques that build mathematical models to capture the characteristics of system's activity and then check whet...
Alberto Volpatto, Federico Maggi, Stefano Zanero
108
Voted
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
14 years 11 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang