Sciweavers

193 search results - page 38 / 39
» Several ways to solve the MSO problem
Sort
View
132
Voted
SOFTVIS
2010
ACM
15 years 1 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
JAIR
2006
179views more  JAIR 2006»
15 years 23 days ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
121
Voted
TPDS
2008
124views more  TPDS 2008»
15 years 21 days ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
75
Voted
MOC
1998
93views more  MOC 1998»
15 years 14 days ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
EDBT
2010
ACM
181views Database» more  EDBT 2010»
14 years 11 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...