Sciweavers

338 search results - page 59 / 68
» On the Complexity of Termination Inference for Processes
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
15 years 10 months ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...
PODS
2002
ACM
167views Database» more  PODS 2002»
15 years 9 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
JCB
2008
159views more  JCB 2008»
14 years 9 months ago
BayesMD: Flexible Biological Modeling for Motif Discovery
We present BayesMD, a Bayesian Motif Discovery model with several new features. Three different types of biological a priori knowledge are built into the framework in a modular fa...
Man-Hung Eric Tang, Anders Krogh, Ole Winther
WMCSA
2012
IEEE
13 years 5 months ago
Code in the air: simplifying sensing and coordination tasks on smartphones
A growing class of smartphone applications are tasking applications that run continuously, process data from sensors to determine the user’s context (such as location) and activ...
Lenin Ravindranath, Arvind Thiagarajan, Hari Balak...