Sciweavers

10608 search results - page 569 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
LICS
2006
IEEE
16 years 1 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
ICDAR
2005
IEEE
16 years 22 days ago
A Statistical Learning Approach To Document Image Analysis
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
Kevin Laven, Scott Leishman, Sam T. Roweis
INFOCOM
2005
IEEE
16 years 21 days ago
Low-state fairness: lower bounds and practical enforcement
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy, Ashis...
ARCS
2005
Springer
16 years 20 days ago
Self-Organizing, Adaptive Data Fusion for 3d Object Tracking
Data fusion concepts are a necessary basis for utilizing complex networks of sensors. A key feature for a robust data fusion system is adaptivity, both to be fault-tolerant and to...
Olaf Kähler, Joachim Denzler
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
16 years 15 days ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere