Sciweavers

696 search results - page 21 / 140
» A class of combinatorial identities
Sort
View
ESWS
2009
Springer
15 years 6 months ago
An Ontology of Resources: Solving the Identity Crisis
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
Harry Halpin, Valentina Presutti
ICASSP
2011
IEEE
14 years 3 months ago
Information-theoretic analysis of desynchronization invariant object identification
This paper is dedicated to the analysis of object identification under desynchronization distortions. While this class of degradations is almost unavoidable in the functionality ...
Oleksiy J. Koval, Sviatoslav Voloshynovskiy, Farza...
JSC
2006
85views more  JSC 2006»
14 years 11 months ago
SumCracker: A package for manipulating symbolic sums and related objects
We describe a new software package, named SumCracker, for proving and finding identities involving symbolic sums and related objects. SumCracker is applicable to a wide range of e...
Manuel Kauers
IOR
2006
177views more  IOR 2006»
14 years 11 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
ASPLOS
2006
ACM
15 years 5 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...