Sciweavers

1424 search results - page 80 / 285
» The Multi-radius Cover Problem
Sort
View
127
Voted
ALMOB
2006
97views more  ALMOB 2006»
15 years 3 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
129
Voted
EOR
2008
97views more  EOR 2008»
15 years 3 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
LREC
2010
130views Education» more  LREC 2010»
15 years 4 months ago
The Problems of Language Identification within Hugely Multilingual Data Sets
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
Fei Xia, Carrie Lewis, William D. Lewis
HCI
2001
15 years 4 months ago
Designing Internet-based systems and services for all: problems and solutions
: Most current electronic services do not address the breadth of design issues necessary to comply with `design-for-all' concepts, despite the fact that various design-for-all...
Panayiotis Koutsabasis, Jenny S. Darzentas, Julio ...
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 3 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito