Sciweavers

1146 search results - page 227 / 230
» Finite cupping sets
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
GI
2009
Springer
13 years 5 months ago
Source Conflicts in Bayesian Identification
: In Bayesian identification an ID source is in conflict with the other ID sources, if both provide substantially different, reliable information on a tracked object. After discuss...
Max Krüger, David Hirschhäuser
ECCC
2010
83views more  ECCC 2010»
13 years 5 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 5 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
BMCBI
2011
13 years 2 months ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...