Sciweavers

663 search results - page 35 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 1 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 1 months ago
Computation reuse for rigid-body dynamics
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
Anne Loomis, Devin J. Balkcom
CN
2006
82views more  CN 2006»
13 years 7 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
SPAA
2006
ACM
14 years 1 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
CSDA
2008
147views more  CSDA 2008»
13 years 7 months ago
Detection of unknown computer worms based on behavioral classification of the host
Machine learning techniques are widely used in many fields. One of the applications of machine learning in the field of the information security is classification of a computer be...
Robert Moskovitch, Yuval Elovici, Lior Rokach