Sciweavers

14298 search results - page 2858 / 2860
» Dynamic Languages and Applications
Sort
View
FOSSACS
2011
Springer
12 years 10 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
ICSE
2011
IEEE-ACM
12 years 10 months ago
Configuring global software teams: a multi-company analysis of project productivity, quality, and profits
In this paper, we examined the impact of project-level configurational choices of globally distributed software teams on project productivity, quality, and profits. Our analysis u...
Narayan Ramasubbu, Marcelo Cataldo, Rajesh Krishna...
SIGMOD
2011
ACM
331views Database» more  SIGMOD 2011»
12 years 9 months ago
Query optimization techniques for partitioned tables
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
Herodotos Herodotou, Nedyalko Borisov, Shivnath Ba...
LICS
2012
IEEE
11 years 9 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
« Prev « First page 2858 / 2860 Last » Next »