Sciweavers

1650 search results - page 305 / 330
» The HOM problem is decidable
Sort
View
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 8 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
CCS
2010
ACM
13 years 7 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
A Bayesian nonparametric method for prediction in EST analysis
Background: Expressed sequence tags (ESTs) analyses are a fundamental tool for gene identification in organisms. Given a preliminary EST sample from a certain library, several sta...
Antonio Lijoi, Ramsés H. Mena, Igor Prü...
COR
2006
82views more  COR 2006»
13 years 7 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
IJRR
2008
109views more  IJRR 2008»
13 years 7 months ago
Robotic Grasping of Novel Objects using Vision
We consider the problem of grasping novel objects, specifically ones that are being seen for the first time through vision. Grasping a previously unknown object, one for which a 3...
Ashutosh Saxena, Justin Driemeyer, Andrew Y. Ng