Sciweavers

1389 search results - page 253 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 2 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
WWW
2010
ACM
15 years 4 months ago
A scalable machine-learning approach for semi-structured named entity recognition
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
Utku Irmak, Reiner Kraft
ICIP
2009
IEEE
15 years 11 months ago
Modified Compressive Sensing For Real-time Dynamic Mr Imaging
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
WWW
2010
ACM
15 years 4 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura