Sciweavers

465 search results - page 37 / 93
» On the Hardness of Range Assignment Problems
Sort
View
DM
2007
97views more  DM 2007»
14 years 11 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
DAGM
2006
Springer
15 years 3 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
BMCBI
2005
155views more  BMCBI 2005»
14 years 11 months ago
Mining protein function from text using term-based support vector machines
Background: Text mining has spurred huge interest in the domain of biology. The goal of the BioCreAtIvE exercise was to evaluate the performance of current text mining systems. We...
Simon B. Rice, Goran Nenadic, Benjamin J. Stapley
AI
1998
Springer
15 years 4 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
SIGSOFT
2009
ACM
16 years 18 days ago
Improving bug triage with bug tossing graphs
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
Gaeul Jeong, Sunghun Kim, Thomas Zimmermann