Sciweavers

3238 search results - page 351 / 648
» Not Enough Points Is Enough
Sort
View
STACS
2004
Springer
16 years 2 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
TACAS
2004
Springer
139views Algorithms» more  TACAS 2004»
16 years 2 days ago
Error Explanation with Distance Metrics
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
Alex Groce
WDAG
2004
Springer
103views Algorithms» more  WDAG 2004»
16 years 2 days ago
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...
James Aspnes, Faith Ellen Fich, Eric Ruppert
CHI
2010
ACM
16 years 1 days ago
Indexicality of language and the art of creating treasures
The indexicality of language refers to the linkage between the language and the situation of use for determining the meaning of what is being said. In this paper I describe how a ...
Matti Rantanen
AVSS
2003
IEEE
16 years 1 days ago
Towards a View Invariant Gait Recognition Algorithm
Human gait is a spatio-temporal phenomenon and typifies the motion characteristics of an individual. The gait of a person is easily recognizable when extracted from a sideview of...
Amit A. Kale, Amit K. Roy Chowdhury, Rama Chellapp...