144 search results - page 25 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
MOBICOM
2005
ACM
14 years 2 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
ICOST
2007
Springer
14 years 2 months ago
2007
Springer
Tracking the movement of people in indoor environments is useful for a variety of applications including elderly care, study of shopper behavior in shopping centers, security etc. ...
AIA
2007
13 years 10 months ago
2007
In this paper we propose the Local Credibility Concept (LCC), a novel technique for incremental classifiers. It measures the classification rate of the classifier’s local mod...
AI
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...