Sciweavers

6575 search results - page 1083 / 1315
» Specializing visualization algorithms
Sort
View
FOSSACS
2011
Springer
13 years 1 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
ICCV
2011
IEEE
12 years 9 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
ICTAC
2010
Springer
13 years 8 months ago
Preference and Non-deterministic Choice
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Bill Stoddart, Frank Zeyda, Steve Dunne
ICALP
2011
Springer
13 years 1 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
14 years 9 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
« Prev « First page 1083 / 1315 Last » Next »