Sciweavers

729 search results - page 67 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
FC
2007
Springer
125views Cryptology» more  FC 2007»
14 years 4 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
LPNMR
1997
Springer
14 years 2 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
PAMI
2008
183views more  PAMI 2008»
13 years 10 months ago
Shape-and-Behavior Encoded Tracking of Bee Dances
Behavior analysis of social insects has garnered impetus in recent years and has led to some advances in fields like control systems, flight navigation etc. Manual labeling of ins...
Ashok Veeraraghavan, Rama Chellappa, Mandyam Srini...
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 10 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
LATIN
2010
Springer
14 years 4 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...