Sciweavers

4112 search results - page 488 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
187
Voted
ALMOB
2006
80views more  ALMOB 2006»
15 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 9 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
MOBIHOC
2010
ACM
15 years 5 months ago
Identifying the missing tags in a large RFID system
Comparing with the classical barcode system, RFID extends the operational distance from inches to a number of feet (passive RFID tags) or even hundreds of feet (active RFID tags)....
Tao Li, Shigang Chen, Yibei Ling
PDPTA
2010
15 years 5 months ago
Disciplined Multi-core Programming in C
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...
Pjotr Kourzanov, Orlando Moreira, Henk J. Sips
QOSA
2010
Springer
15 years 5 months ago
A Hybrid Approach for Multi-attribute QoS Optimisation in Component Based Software Systems
Design decisions for complex, component-based systems impact multiple quality of service (QoS) properties. Often, means to improve one quality property deteriorate another one. In ...
Anne Martens, Danilo Ardagna, Heiko Koziolek, Raff...