14121 search results - page 578 / 2825 » Interval Computations in Computer Vision |
214
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
201
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
186
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Pathway-targeted or low-density arrays are used more and more frequently in biomedical research, particularly those arrays that are based on quantitative real-time PCR...
200
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
184
click to vote
EOR
2007
15 years 7 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...