Sciweavers

2304 search results - page 275 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICDAR
2005
IEEE
16 years 6 days ago
Distinguishing Mathematics Notation from English Text using Computational Geometry
A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no a...
Derek M. Drake, Henry S. Baird
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
16 years 6 days ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
ASPLOS
2004
ACM
16 years 1 days ago
Scalable selective re-execution for EDGE architectures
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
Rajagopalan Desikan, Simha Sethumadhavan, Doug Bur...
FTRTFT
1998
Springer
15 years 10 months ago
A Modular Visual Model for Hybrid Systems
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
Radu Grosu, Thomas Stauner, Manfred Broy
CSCLP
2006
Springer
15 years 10 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan