Sciweavers

89 search results - page 7 / 18
» Effective Set Membership in Computer Algebra and Beyond
Sort
View
106
Voted
AB
2007
Springer
15 years 3 months ago
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
Venkatesh Mysore, Bud Mishra
CVPR
2010
IEEE
15 years 5 months ago
Optimizing One-Shot Recognition with Micro-Set Learning
For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional clas...
Kevin Tang, Marshall Tappen, Rahul Sukthankar, Chr...
CADE
2007
Springer
15 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
CSL
2006
Springer
15 years 1 months ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski
MOBIHOC
2008
ACM
15 years 9 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...